#include <fstream>
#include <vector>
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
int n,i,x,y,m,k,fr[50005],sol[50005],viz[50005];
vector <int> v[50005];
void dfs (int nod)
{
    viz[nod]=1;
    for (int i=0; i<v[nod].size (); i++)
    {
        int vecin=v[nod][i];
        if (viz[vecin]==0)
            dfs (vecin);
    }
    sol[++k]=nod;
}
int main()
{
    fin>>n>>m;
    for (i=1; i<=m; i++)
    {
        fin>>x>>y;
        v[x].push_back (y);
        fr[y]++;
    }
    for (i=1; i<=n; i++)
    {
        if (fr[i]==0)
            dfs (i);
    }
    for (i=k; i>0; i--)
        fout<<sol[i]<<" ";
    return 0;
}