#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
#define pb push_back
const int Nmax = 50000 + 5;
int n, m, dp[Nmax];
bool viz[Nmax];
vector<int>v[Nmax], p;
void sortt(int nod)
{
    viz[nod] = 1;
    for(auto i : v[nod])
        if(!viz[i] && dp[i] > dp[nod] + 1)
        {
            dp[i] = dp[nod] + 1;
            sortt(i);
        }
    p.pb(nod);
}
int main()
{
   fin >> n >> m;
   for(int i = 1, a, b; i <= m; ++i)
   {
        fin >> a >> b;
        v[a].pb(b);
   }

   for(int i = 1; i <= n; ++i)dp[i] = 1 << 30;

   for(int i = 1; i <= n; ++i)
        if(!viz[i])dp[i] = 0, sortt(i);
    for(int i = p.size() - 1; i >= 0; --i)
        fout << p[i] << ' ';
    return 0;
}