#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

int n, m;
vector <int> G[50001];
int intr[50001];
queue <int> q;

int main()
{
    int i, x, y, k;
    fin >> n >> m;
    for (i = 1 ; i <= m ; i++)
    {
        fin >> x >> y;
        G[x].push_back(y);
        ++intr[y];
    }
    for (i = 1 ; i <= n ; i++)
        if (intr[i] == 0)
            q.push(i);
    while (!q.empty())
    {
        k = q.front();
        q.pop();
        fout << k << " ";
        for (auto next : G[k])
        {
            --intr[next];
            if (intr[next] == 0)
                q.push(next);
        }
    }
    return 0;
}