#include <bits/stdc++.h>

using namespace std;

vector<int> v[50001];
bool viz[50001]={false};
int sol[50001]={0}, lg = 0;

void dfs(int nod){
    viz[nod] = true;
    for(int i=0; i<v[nod].size(); i++)
        if(!viz[v[nod][i]])
            dfs(v[nod][i]);
    sol[++lg] = nod;
}

int main()
{
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    int i, n, m, a, b;
    f >> n >> m;
    for(i=1; i<=m; i++){
        f >> a >> b;
        v[a].push_back(b);
    }
    for(i=1; i<=n; i++)
        if(!viz[i])
            dfs(i);
    for(i=lg; i>0; i--)
        g << sol[i] << " ";
    g << "\n";
}