#include <bits/stdc++.h>
using namespace std;
const int N = 3e4 + 5;
int n, m, a, b, ans[N], vis;
bool mark[N];
vector<int> v[N];
void dfs(int k) {
  mark[k] = true;
  for (int i = 0; i < v[k].size(); i++) {
    if (!mark[v[k][i]]) {
      dfs(v[k][i]);
    }
  }
  ans[++vis] = k;
}
int main() {
  scanf("%d %d", &n, &m);
  while (m--) {
    scanf("%d %d", &a, &b);
    v[a].push_back(b);
  }
  for (int i = 1; i <= n; i++) {
    if (mark[i]) {
      continue;
    }
    dfs(i);
  }
  if (n > m)
    for (int i = 1; i <= n; i++) printf("%d ", ans[i]);
  return 0;
}
