#include <iostream>
#include<cstdio>
#include<vector>
#define Nmax 100001
using namespace std;
vector<int> G[Nmax];
int N,M,V[Nmax],k;
bool Use[Nmax];
void DFS(int nod)
{
    vector <int>:: iterator it;
    Use[nod]=1;
    for(it=G[nod].begin();it!=G[nod].end();it++)
        if(!Use[*it])
            DFS(*it);
    V[++k]=nod;
}
int main()
{
   int i,x,y;
   freopen("sortaret.in","r",stdin);
   freopen("sortaret.out","w",stdout);
   scanf("%d %d",&N,&M);
   for(i=1;i<=M;i++)
   {
       scanf("%d %d",&x,&y);
       G[x].push_back(y);
   }
   for(i=1;i<=N;i++)
        if(!Use[i])
            DFS(i);
   for(i=k;i>=1;i--)
        printf("%d ",V[i]);
    return 0;
}