#include <iostream>
#include <cstdio>
#include <vector>
#include <bitset>

using namespace std;

vector <int> g[50005];
bitset <50005> viz;
vector <int> sol;

int n,m,x,y;

void dfs(int nod){
    viz[nod]=1;
    for(int i:g[nod])
        if(!viz[i])
            dfs(i);

    sol.push_back(nod);
}

int main()
{
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    cin>>n>>m;

    for(int i=0;i<m;++i){
        cin>>x>>y;
        g[x].push_back(y);
    }

    for(int i=1;i<=n;++i){
        if(!viz[i])
            dfs(i);
    }

    for(int i=sol.size()-1;i>=0;--i)
        cout<<sol[i]<<" ";

    return 0;
}