#include <bits/stdc++.h>

using namespace std;

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

int n, m, st[50003], len;
vector<int> h[50003];
bitset<50003> viz;

void Citire()
{
    int x, y;
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        h[x].push_back(y);
    }
}

void DFS(int k)
{
    viz[k] = 1;
    for (int w : h[k])
        if (viz[w] == 0)
            DFS(w);
    st[++len] = k;
}

void SortareTop()
{
    int i;
    for (i = 1; i <= n; i++)
        if (viz[i] == 0)
            DFS(i);
}

int main()
{
    Citire();
    SortareTop();
    for (int i = n; i >= 1; i--)
        fout << st[i] << " ";
    return 0;
}