#include <bits/stdc++.h>

using namespace std;

vector <int> a[50001];
queue <int> q;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int grad_interior[50001];
int main()
{
    int n, m;
    f>>n>>m;
    for (size_t i = 0; i < m; i++) {
        int x, y;
        f>>x>>y;
        a[x].push_back(y);
        grad_interior[y]++;
    }


    for (int i = 1; i <= n; i++) {
        if (grad_interior[i] == 0) {
            q.push(i);
        }
    }

    while (!q.empty())
    {
        int x = q.front();
        q.pop();
        g<<x<<" ";
        for (auto it : a[x])
        {
            grad_interior[it]--;
            if (grad_interior[it] == 0)
            {
                q.push(it);
            }
        }

    }

    //cout << "Hello world!" << endl;
    return 0;
}