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

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n, m, i, x, y, s[100010];
bool v[100010];
vector<int > G[100010];

void dfs(int k)
{
    v[k] = true;
    for (int i = 0; i < G[k].size(); ++i)
        if (v[G[k][i]] == false)
            dfs(G[k][i]);
    s[++s[0]] = k;
}

int main()
{
    f >> n >> m;
    for (i = 1; i <= m; ++i)
    {
        f >> x >> y;
        G[x].push_back(y);
    }
    for (i = 1; i <= n; ++i)
        if (v[i] == false)
            dfs(i);
    for (i = s[0]; i >= 1; --i)
        g << s[i] << " ";
    return 0;
}