#include <bits/stdc++.h>
using namespace std;

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

const int N = 50005;

vector <int> v[N];
bool viz[N];
int a[N], lug, n, m, x, y;

void dfs(int k)
{
    viz[k] = 1;
    for(int i = 0; i < v[k].size(); ++ i)
    {
        int l = v[k][i];
        if(!viz[l])
        {
            dfs(l);
        }
    }
    a[++ lug] = k;
}
int main()
{
    f >> n >> m;
    for(int i = 1; i <= m; ++ i)
    {
        f >> x >> y;
        v[x].push_back(y);
    }
    for(int i = 1; i <= n; ++ i)
        if(!viz[i])
            dfs(i);
    for(int i = lug; i >= 1; i --)
        g << a[i] << " ";
    return 0;
}