#include <fstream>
#include <vector>
#include <algorithm>
#include <queue>

using namespace std;

ifstream cin ("sortaret.in");
ofstream cout ("sortaret.out");

const int N = 5e4;

vector <int> g[N + 1];

int pred[N + 1];

vector <int> sol;

queue <int> q;

int n, m, x, y;

int main()
{
    cin >> n >> m;
    for (int i= 1; i <= m; ++i)
    {
        cin >> x >> y;
        pred[y]++;
        g[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
        if (!pred[i])
            q.push(i);
    while (!q.empty())
    {
        int x = q.front();
        sol.push_back(x);
        q.pop();
        for (auto it : g[x])
        {
            pred[it]--;
            if (!pred[it])q.push(it);
        }
    }
    for (auto it : sol)
        cout << it << ' ';
    return 0;
}