#include <fstream>
#include <algorithm>
#include <vector>
#include <queue>
using namespace std;
int n, m;
queue<int> q;
int d[50001];
vector<int> g[50001];
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int a, b;
        cin >> a >> b;
        g[a].push_back(b);
        d[b]++;
    }
    for (int i = 1; i <= n; i++)
    {
        if (d[i] == 0)
            q.push(i);
    }
    while (!q.empty())
    {
        int nod = q.front();
        for (int i : g[nod])
        {
            d[i]--;
            if (d[i] == 0) q.push(i);
        }
        cout << nod << " ";
        q.pop();
    }
    return 0;
}