#include <fstream>
#include <vector>

using namespace std;

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

int v[100001],i,j,m,n,sol[1000001],nr,a,b,check[100001];
std::vector <int> l[100001];

void dfs(int k){
    v[k]=1;
    for(int i = 0 ;i < l[k].size(); i++){
        if(v[l[k][i]] == 0){
            v[l[k][i]]=1;
            dfs(l[k][i]);
        }
    }
    sol[++nr]=k;
}

int main()
{
    f >> n >> m;
    for( i = 1;i <= m; i ++){
        f >> a >> b;
        l[a].push_back(b);
        check[b]=1;
    }
    for(i = 1; i <=n;i++)
        if(check[i]==0)
            dfs(i);
    for(i = nr; i>=1; i--)
        g << sol[i] << " ";
    return 0;
}