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

const int dim = 50002;
vector<int> a[dim], ordine;
int n, grad[dim];
bool viz[dim];

void dfs (int x)
{
    viz[x] = 1;
    for (int y : a[x])
        if (!viz[y])
            dfs(y);
    ///Am parcurg toti vecinii lui x
    ///Iar vecinii la randul lor au vizitat toate nodurile din subgraf
    ordine.push_back(x);
}
int main()
{
    int m, x, y;
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y; ///muchia orientata x->y
        a[x].push_back(y);
        grad[y]++;
    }

    for (int i = 1; i <= n; i++)
        if (!viz[i] && grad[i] == 0)
            dfs(i);

    reverse(ordine.begin(), ordine.end());

    for (int x : ordine)
        fout << x << ' ';
}