#include <bits/stdc++.h>
using namespace std;
const int MAXN = 3e4 + 7;
int n, m, timer = 0;
vector<int> g[MAXN], ans;
int tin[MAXN], tout[MAXN];
char used[MAXN];
void dfs(int v) {
  used[v] = true;
  tin[v] = ++timer;
  for (size_t i = 0; i < g[v].size(); ++i) {
    int to = g[v][i];
    if (!used[to]) dfs(to);
  }
  tout[v] = ++timer;
  ans.push_back(v);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int i = 0; i < m; ++i) {
    int a, b;
    scanf("%d%d", &a, &b);
    --a, --b;
    g[a].push_back(b);
  }
  for (int i = 0; i < n; ++i) {
    if (!used[i]) dfs(i);
  }
  for (size_t i = 0; i < ans.size(); ++i) printf("%d ", ans[i] + 1);
  return 0;
}
