#include <bits/stdc++.h>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector <int> a[50001];
int n, m, x, y, grad[50001];

queue <int> coada;

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; ++i)
    {
        fin >> x >> y;
        a[x].push_back(y);
        grad[y]++;
    }
    for (int i = 1; i <= n; ++i)
    {
        if (grad[i] == 0)
        {
            coada.push(i);
            grad[i]--;
            for (auto x : a[i]) grad[x]--;
        }
    }
    while (coada.size() != n)
    {
        for (int i = 1; i <= n; ++i)
        {
            if (grad[i] == 0)
            {
                coada.push(i); grad[i]--;
                for (auto x : a[i]) grad[x]--;
            }
        }
    }
    while (!coada.empty())
    {
        fout << coada.front() << ' '; coada.pop();
    }
    return 0;
}