#include <iostream>
#include <fstream>
#include <vector>
#define pb push_back
#define NM 50005
#define MM 100005
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
int n,m,a,b;
int dist[NM],viz[NM];
vector <int> v[NM],sol;
void dfs(int nod)
{
    for(int i=0;i<v[nod].size();++i)
    {
        if(viz[v[nod][i]]==0 && (dist[v[nod][i]]>dist[nod]+1 || dist[v[nod][i]]==0))
        {
            viz[v[nod][i]]=1;
            dist[v[nod][i]]=dist[nod]+1;
            dfs(v[nod][i]);
        }
    }
    sol.pb(nod);
}
int main()
{
    in>>n>>m;
    for(int i=1;i<=m;++i)
    {
        in>>a>>b;
        v[a].pb(b);
    }
    for(int i=1;i<=n;++i)
    {
        dist[i]=0;
        if(viz[i]==0)dfs(i);
    }
    for(int i=n-1;i>=0;--i)out<<sol[i]<<" ";
    return 0;
}