/*
https://infoarena.ro/problema/sortaret
*/
#include <fstream>
#include <queue>

using namespace std;

int main()
{
    ifstream in("sortaret.in");
    ofstream out("sortaret.out");
    int n, m;
    in >> n >> m;
    vector <vector <int>> l_s(n + 1);
    vector <int> nr_p(n + 1, 0);
    for (int i = 0; i < m; i++)
    {
        int x, y;
        in >> x >> y;
        l_s[x].push_back(y);
        nr_p[y]++;
    }
    in.close();
    queue <int> q;
    for (int i = 1; i <= n; i++)
    {
        if (nr_p[i] == 0)
        {
            q.push(i);
        }
    }
    while (!q.empty())
    {
        int x = q.front();
        q.pop();
        out << x << " ";
        for (auto y: l_s[x])
        {
            nr_p[y]--;
            if (nr_p[y] == 0)
            {
                q.push(y);
            }
        }
    }
    out << "\n";
    out.close();
    return 0;
}