#include <iostream>
#include <fstream>
#include <vector>
#include <queue>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int main()
{
    int n,m,i,a,b;
    fin>>n>>m;
    vector<vector<int>>g(n+1);
    vector<int>nr_arce_int(n+1,0);
    queue<int>q;
    for(i=1; i<=m; i++)
    {
        fin>>a>>b;
        nr_arce_int[b]++;
        g[a].push_back(b);
    }
    for(i=1; i<=n; i++)
        if(nr_arce_int[i]==0)
            q.push(i);

    while(!q.empty())
    {
        int nod=q.front();
        fout<<nod<<" ";
        q.pop();
        for(auto vecin:g[nod])
        {
            nr_arce_int[vecin]--;
            if(nr_arce_int[vecin]==0)
                q.push(vecin);
        }
    }
    return 0;
}