#include <bits/stdc++.h>

using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
const int nmax = 5e4;
int n, m;
vector <int> g[nmax + 1];
int d[nmax + 1];
queue <int> q;
void topologic_sort()
{
    while(!q.empty())
    {
        int nod = q.front();
        q.pop();
        for(int i = 0; i < g[nod].size(); i++)
        {
            d[g[nod][i]]--;
            if(d[g[nod][i]] == 0)
            {
                out<<g[nod][i]<<" ";
                q.push(g[nod][i]);
            }
        }
    }
}
int main()
{
    int x, y;
    in>>n>>m;
    for(int i = 1; i <= m; i++)
    {
        in>>x>>y;
        g[x].push_back(y);
        d[y]++;
    }
    for(int i = 1; i <= n; i++)
    {
        if(d[i] == 0)
        {
            q.push(i);
            out<<i<<" ";
        }
    }
    topologic_sort();
}