#include <bits/stdc++.h>
using namespace std;
const int maxn = 30005;
int n, m, cnt;
vector<int> edge[maxn];
int end[maxn];
bool vis[maxn];
void dfs(int x) {
  vis[x] = true;
  for (int(i) = 0; (i) < edge[x].size(); i++) {
    int y = edge[x][i];
    if (vis[y]) continue;
    dfs(y);
  }
  printf("%d ", x);
}
int main() {
  scanf("%d%d", &n, &m);
  for (int(i) = 0; (i) < m; i++) {
    int u, v;
    scanf("%d%d", &u, &v);
    edge[u].push_back(v);
  }
  for (int(i) = 1; (i) <= n; i++) {
    if (!vis[i]) dfs(i);
  }
  return 0;
}
