#include<iostream>
#include<fstream>
#include<vector>
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int N,M,i,viz[50005],x,y,coada[50005],k;
vector <int> v[50005];

void dfs(int nod)
{
    viz[nod]=1;
    for(int j=0;j<v[nod].size();j++)
        if(viz[v[nod][j]]==0)
            dfs(v[nod][j]);
    coada[++k]=nod;
}

int main()
{
    f>>N>>M;

    for(i=1;i<=M;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
    }

    for(i=1;i<=N;i++)
        if(viz[i]==0)
            dfs(i);

    for(i=k;i>=1;i--)
        g<<coada[i]<<" ";

    f.close();
    g.close();
    return 0;
}