#include <bits/stdc++.h>
using namespace std;
const int T = 1e5 + 5;
int d[T], p[T];
vector<long long> g[T];
int a, b, n, m, i, j;
void changee(int p1, int p2) {
  int a = d[p1];
  int b = d[p2];
  d[p1] = b;
  d[p2] = a;
  p[a] = p2;
  p[b] = p1;
}
void go(int a, int b) {
  if (a > b) return;
  int cur = a;
  int v = d[a];
  for (int i = 0; i < g[v].size(); i++) {
    int to = g[v][i];
    int where = p[to];
    if (where >= a && where <= b && where >= cur) {
      changee(cur, where);
      cur++;
    }
  }
  changee(p[v], cur);
  go(a, cur - 1);
  go(cur + 1, b);
}
int main() {
  cin >> n >> m;
  for (i = 0; i < m; i++) {
    cin >> a >> b;
    g[a].push_back(b);
  }
  for (i = 1; i <= n; i++) d[i] = i, p[i] = i;
  go(1, n);
  for (i = 1; i <= n; i++) cout << d[i] << " ";
  cout << endl;
}
