#include <bits/stdc++.h>
#include <fstream>
#include <queue>
#include <vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int main() {
  int n, m;
  f >> n >> m;
  vector<vector<int>> adj(n + 1);
  vector<int> inDegree(n + 1, 0);
  queue<int> q;
  for (int i = 0; i < m; i++) {
    int x, y;
    f >> x >> y;
    adj[x].push_back(y);
    inDegree[y]++;
  }
  for (int i = 1; i <= n; i++)
    if (!inDegree[i])
      q.push(i);

  while (!q.empty()) {
    int leaf = q.front();
    q.pop();
    g << leaf << " ";
    for (auto it : adj[leaf]) {
      if (!--inDegree[it])
        q.push(it);
    }
  }
  return 0;
}