#include <bits/stdc++.h>

using namespace std;

#define pb push_back

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

int const lim=50001;
int n,m,v[lim];
vector < int > c[lim];
deque < int > d;

void dfs(int nod)
{
    v[nod]=1;

    for(int i=0;i<c[nod].size();i++)
        if(v[c[nod][i]]==0)
       {
           dfs(c[nod][i]);

       }
   d.push_front(nod);
}

int main()
{
   in>>n>>m;
   for(int i=1;i<=m;i++)
   {
       int x,y;
       in>>x>>y;
       c[x].pb(y);
   }

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

   while( !d.empty() )
   {
       out<<d.front()<<" ";
       d.pop_front();
   }
}