#include <bits/stdc++.h>
#define q 50005

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector <int>t[q];
int n,m,x,y,p[q],k,sol[q];

void dfs(int nod)
{
    p[nod]=1;
    for(int i=0;i<t[nod].size();i++){
        int z=t[nod][i];
        if(p[z]==0)
            dfs(z);
    }
    sol[k++]=nod;
}

int main()
{
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        t[x].push_back(y);
    }
    for(int i=1;i<=n;i++){
        if(p[i]==0)
            dfs(i);
    }

    for(int i=k;i>=1;i--)
        fout<<sol[i]<<" ";


    return 0;
}