#include <fstream>
#include <queue>
using namespace std;
ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");
int n,m;
vector<int> g[50005];
int d[50005];
queue<int> q;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n >> m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin >> x >> y;
        g[x].push_back(y);
        d[y]++;
    }
    for(int i=1;i<=n;i++)
    {
        if(d[i])
            continue;
        q.push(i);
    }
    while(!q.empty())
    {
        int vf = q.front();
        cout << vf << ' ';
        q.pop();
        for(auto urm:g[vf])
        {
            d[urm]--;
            if(d[urm]==0)
                q.push(urm);
        }
    }
    return 0;
}