#include <fstream>
#include <vector>
#include <queue>
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector <int> v[50001];
queue <int> q;
int d[50001];
int main()
{
    int n,m,x,y;
    in>>n>>m;
    for (int i=1; i<=m; i++)
    {
        in>>x>>y;
        v[x].push_back(y);
        d[y]++;
    }
    for (int i=1; i<=n; i++)
    {
        if (d[i]==0)
            q.push(i);
    }
    while (!q.empty())
    {
        x=q.front();
        q.pop();
        out<<x<<" ";
        for (int i=0; i<v[x].size(); i++)
        {
            d[v[x][i]]--;
            if (d[v[x][i]]==0) q.push(v[x][i]);
        }
    }
    return 0;
}