#include <bits/stdc++.h>

using namespace std;

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

int n, m, i, j, x, y, a[500005];

vector <int> v[500005];
queue <int> q;

int main()
{
    fin >> n >> m;

    for(i = 1; i <= m; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
        a[y]++;
    }

    for(i = 1; i <= n; i++)
        if(a[i] == 0)
          q.push(i);

    while(!q.empty())
    {
        int x = q.front();
        fout << x << " ";
        q.pop();

        for(auto i : v[x])
        {
            a[i]--;
            if(a[i]==0)
                q.push(i);
        }
    }
    return 0;
}