#include <stdio.h>
#include <bits/stdc++.h>

#define rep(i, n) for(int i = 0; i < n; i++)
#define REP(i,a,b) for(int i = a; i < b; i++)

using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
// const int INF = 0x3f3f3f3f;
const int Nmax = 50333;

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

int N, M, x, y;
int gin[Nmax]; // grad in
int result[Nmax];
vector<int> G[Nmax];

int main(void) {
  fin >> N >> M;
  rep(i, N) {
    fin >> x >> y;
    --x, --y;
    gin[y]++;
    G[x].push_back(y);
  }
  queue<int> Q;
  int pos = 0;
  rep(i, N) {
    if (gin[i] == 0) {
      Q.push(i); gin[i]--;
      while(!Q.empty()) {
        x = Q.front(); Q.pop();
        result[pos] = x;
        pos++;
        for(int y: G[x]) {
          gin[y]--;
          if (gin[y] == 0) {
            Q.push(y); gin[y]--;
          }
        }
      }
    }
  }
  rep(i, N)
    fout <<  result[i]+1 << ' ';
  fout << endl;

  return 0;
}