#include <fstream>
#include <vector>
#include <queue>
using namespace std;

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

vector<int> L[50001];
int in[100001];
int main()
{
    int n,m;
    fin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        fin>>x>>y;
        L[x].push_back(y);
        in[y]++;
    }
    priority_queue <int, vector<int>, greater<int>> q;
    for(int i=1; i<=n; i++)
        if(in[i]==0)
            q.push(i);
    while(!q.empty())
    {
        int curr=q.top();
        q.pop();
        fout<<curr<<" ";
        for(auto it:L[curr])
        {
            in[it]--;
            if(in[it]==0)
                q.push(it);
        }
    }
    return 0;
}