#include <iostream>
#include <string>
#include <algorithm>
#include <set>
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
#include <math.h>
#define each(i,n) (int i=1;i<=(n);++i)
using namespace std;
int head[100004],rudu[100004];
struct node
{
    int to,next;
}bian[100004];
int top=0;
int queu[100004];
void add(int a,int b)
{
    bian[top].to=b;
    bian[top].next=head[a];
    head[a]=top++;
}
int main()
{
    int n,m;
    while(~scanf("%d%d",&n,&m))
    {
        int a,b;
        memset(head,-1,sizeof(head));
        memset(rudu,0,sizeof(rudu));
        for(int i=0;i<m;i++)
        {
            cin>>a>>b;
            add(a,b);
            rudu[b]++;
        }
        int c=0;
        while(c<n)
        {
            for(int i=1;i<=n;i++)
            {
                if(rudu[i]==0)
                {
                    queu[c++]=i;
                    rudu[i]=-1;
                    for(int j=head[i];j!=-1;j=bian[j].next)
                        rudu[bian[j].to]--;
                    break;
                }
            }
        }
        for(int i=0;i<c;i++)
        {
            printf(i==c-1?"%d\n":"%d ",queu[i]);
        }
    }
    return 0;
}