#include <bits/stdc++.h>
using namespace std;
int n, m;
vector<int> v[100010];
int vis[100010];
queue<int> q;
void dfs(int u) {
  vis[u] = 1;
  int size = v[u].size();
  for (int i = 0; i < size; i++) {
    if (!vis[v[u][i]]) {
      dfs(v[u][i]);
    }
  }
  q.push(u);
}
int main() {
  int x, y;
  while (~scanf("%d%d", &n, &m)) {
    for (int i = 0; i < m; i++) {
      scanf("%d%d", &x, &y);
      v[x].push_back(y);
    }
    for (int i = 1; i <= n; i++) {
      if (!vis[i]) {
        dfs(i);
      }
    }
    while (!q.empty()) {
      printf("%d ", q.front());
      q.pop();
    }
  }
  return 0;
}
