#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#define MAX 50001

using namespace std;

int n,m,grad[MAX],x,y;
vector<int> nd[MAX];
queue<int> q;

int main()
{
    ifstream f ("sortaret.in");
    ofstream g ("sortaret.out");
    f>>n>>m;
    for(int i=1;i<=m;i++){
      f>>x>>y; nd[x].push_back(y);
      grad[y]++;
    }
    for(int i=1;i<=n;i++)
      if(grad[i]==0)q.push(i);
    while(not q.empty()){
      int ac=q.front();q.pop();
      g<<ac<<" ";
      for(auto i:nd[ac]){
        grad[i]--;
        if(grad[i]==0)q.push(i);
      }
    }
    f.close ();
    g.close ();
    return 0;
}