#include <bits/stdc++.h>

using namespace std;

int n,m,x,y;

queue <int> q;

struct nodS
{
    vector <int> nod;
    int deg;
} v[50005];

int main()
{
    ifstream fin ("sortaret.in");
    ofstream fout ("sortaret.out");
    fin>>n>>m;
    for(int i=1; i<=m; ++i)
    {
        fin>>x>>y;
        v[x].nod.push_back(y);
        v[y].deg++;
    }
    for(int i=1; i<=n; ++i)
    {
        if(!v[i].deg)
        {
            q.push(i);
        }
    }
    while(!q.empty())
    {
        int curent=q.front();
        q.pop();
        fout<<curent<<" ";
        for(auto it : v[curent].nod)
        {
            v[it].deg--;
            if(!v[it].deg)
            {
                q.push(it);
            }
        }
    }
    return 0;
}