#include <bits/stdc++.h>
using namespace std;
ifstream fin ("sortaret.in");
ofstream fout ("sortaret.out");
vector <int> v[50001];
int viz[50001];
int n, m;
int sol[50001];
int l;
void dfs (int x)
{
    if (!viz[x])
    {
        viz[x] = 1;
        for (int i = 0; i < v[x].size (); i++)
            dfs (v[x][i]);
        sol[l--] = x;
    }
}
int main ()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int x, y;
        fin >> x >> y;
        v[x].push_back (y);
    }
    l = n;
    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
            dfs (i);
    }
    for (int i = 1; i <= n; i++)
        fout << sol[i] << " ";
}