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

using namespace std;

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

int n, m;
vector<int> G[50001], R;
bool V[50001];

void Dfs(int x)
{
    for (int y : G[x])
    {
        if (!V[y])
            Dfs(y);
    }
    V[x] = true;
    R.push_back(x);
}

int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; ++i)
    {
        int x, y;
        fin >> x >> y;
        G[x].push_back(y);
    }
    for (int i = 1; i <= n; ++i)
    {
        sort(G[i].begin(), G[i].end());
        G[i].erase(unique(G[i].begin(), G[i].end()), G[i].end());
    }
    for (int i = 1; i <= n; ++i)
    {
        if (!V[i])
            Dfs(i);
    }
    for (int i = R.size() - 1; i >= 0; --i)
        fout << R[i] << " ";

    return 0;
}