#include <fstream>
#include <vector>

using namespace std;

ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

vector <int> G[100001];
int viz[100001], sol[100001], n, m, x, y, k, nr[1000001];

void dfs(int v)
{
    viz[v] = 1;
    for (int i = 0; i < G[v].size(); i++)
    {
        if (viz[G[v][i]] == 0)
        {
            dfs(G[v][i]);
        }
    }
    sol[++k] = v;
}
int main()
{
    cin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        cin >> x >> y;
        G[x].push_back(y);
        nr[y]++;
    }
    k=0;
    for (int i = 1; i <= n; i++)
    {
        if (nr[i] == 0)
        {
            dfs(i);
        }
    }
    for (int i = k; i >= 1; i--)
    {
        cout << sol[i] << ' ';
    }
    return 0;
}