#include <fstream>
#include <iostream>
#include <queue>
#include <vector>

using namespace std;

const int NMAX = 50001;

int freq[NMAX];
vector<int> v[NMAX];
queue<int> q;

int main() {
  int n, m;
  ifstream cin("sortaret.in");
  ofstream cout("sortaret.out");

  cin >> n >> m;

  for (int i = 0; i < m; i++) {
    int x, y;

    cin >> x >> y;

    v[x].push_back(y);
    freq[y]++;
  }

  for (int i = 1; i <= n; i++) {
    if (!freq[i]) {
      q.push(i);
    }
  }

  while (!q.empty()) {
    // cout << "plm";
    int k = q.front();

    q.pop();

    cout << k << " ";

    for (int i = 0; i < v[k].size(); i++) {
      freq[v[k][i]]--;

      if (!freq[v[k][i]]) {
        q.push(v[k][i]);
      }
    }
  }

  return 0;
}