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

using namespace std;

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

vector <int> g[50005];
int v[50005], k;
bool viz[50005];

void dfs(int nod)
{
    viz[nod] = 1;
    for (int i = 0; i < g[nod].size(); i++)
        if (!viz[g[nod][i]])
            dfs(g[nod][i]);
    v[++k] = nod;
}

int main()
{
    int n, m;
    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++)
        if (!viz[i])
            dfs(i);
    for (int i = k; i >= 1; i--)
        fout << v[i] << ' ';
    fout << '\n';
    return 0;
}