#include <iostream>
#include <fstream>
#include <vector>
#include <deque>

using namespace std;

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

vector <int> v[50001];
deque <int> deq;
int n, m , grad[50001];

int main()
{
   int i, j;
   f >> n >> m;
   while(m)
   {
       int x, y;
       f >> x >> y;
       v[x].push_back(y);
       grad[y]++;
       m--;
   }
   for(i = 1 ; i <= n ; i++)
   {
        if(grad[i] == 0)
            deq.push_back(i);
   }
   while(!deq.empty())
   {
       int a;
       a = deq.front();
       for(i = 0 ; i < v[a].size() ; i++)
       {
           grad[v[a][i]]--;
           if(grad[v[a][i]] == 0)
                deq.push_back(v[a][i]);
       }
       g << a << " ";
       deq.pop_front();
   }
}