#include <iostream>
#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int NMAX = 50001;
vector<int> G[NMAX];
bool viz[NMAX];

void dfs(int x, vector<int> &S)
{
    viz[x] = true;
    for (auto vec: G[x])
    {
        if (!viz[vec])
        {
            dfs(vec, S);
        }
    }
    /// dupa ce am terminat de procesat nodurile, le pun in vector
    S.push_back(x);
}

int main()
{
    int n, m;
    f >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        f >> x >> y;
        G[x].push_back(y);
    }
    vector<int> sortare;
    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
        {
            dfs(i, sortare);
        }
    }
    reverse(sortare.begin(), sortare.end());
    for (auto nod: sortare)
    {
        g << nod << ' ';
    }
    return 0;

}