#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <queue>
#define MAXN 50000

using namespace std;

int pre[MAXN];
vector<int> post[MAXN];

int main(){
  int n, m;

  ifstream fin ("sortaret.in");
  fin >> n >> m;
  for(int i = 0; i < n; i ++){
    int a, b;
    fin >> a >> b;
    a --;
    b --;

    pre[b] ++;
    post[a].push_back(b);
  }

  queue<int> cd;

  for(int i = 0; i < n; i ++)
    if(pre[i] == 0)
      cd.push(i);

  ofstream fout ("sortaret.out");
  while(!cd.empty()){
    int id = cd.front();
    cd.pop();
    fout << id + 1 << " ";

    for(int i = 0; i < post[id].size(); i ++){
      int node = post[id][i];
      pre[node] --;
      if(pre[node] == 0)
        cd.push(node);
    }
  }
  fout.close();

  return 0;
}