#include <iostream>
#include <bits/stdc++.h>

using namespace std;

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

int n,m;
vector<int> la[50005];
vector<int> topo;
int viz[50005];

void dfs(int s)
{
    viz[s] = 1;
    for (auto el: la[s])
    {
        if (viz[el] == 0)
            dfs(el);
    }
    topo.push_back(s);
}

int main()
{
    f >> n >> m;
    for (int i = 0; i < m; i++)
    {
        int x, y;
        f >> x >> y;
        la[x].push_back(y);
    }

    for (int i = 1; i <= n; i++)
    {
        if (viz[i] == 0)
            dfs(i);
    }

    reverse(topo.begin(), topo.end());

    for (auto el: topo)
    {
        g << el << ' ';
    }

    return 0;
}