#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
# define nmax 50005
# define mmax 100005
vector<int>graf[nmax];
int n,m,coada[nmax],grd[nmax],ps=1;
void bfs()
{ int i,pi=1;
    for(i=1;i<=n;i++)
    if(grd[i]==0){ coada[ps]=i; ps++; }
    while(pi<=ps)
    { for(i=0;i<graf[coada[pi]].size();i++)
             {     grd[graf[coada[pi]][i]]--;
                if(grd[graf[coada[pi]][i]]==0){coada[ps]=graf[coada[pi]][i];ps++;}
            }

            pi++;
    }
 for(i=1;i<=n;i++)
     out<<coada[i]<<" ";

}


int main()
{ int i,a,b,j;
    in>>n>>m;
    for(i=1;i<=m;i++)
    { in>>a>>b;
        graf[a].push_back(b);
        grd[b]++;
    }
bfs();
 /*for(j=1;j<=n;j++)
    {
     cout<<j<<" ";
    for(i=0;i<graf[j].size();i++)
        cout<<graf[j][i]<<" ";
        cout<<"\n"; } */


    return 0;
}