#include <bits/stdc++.h>
using namespace std;
vector<int> G[30009];
bool vis[30009];
void dfs(int x) {
  vis[x] = 1;
  for (int i = 0; i < G[x].size(); i++)
    if (!vis[G[x][i]]) dfs(G[x][i]);
  printf("%d ", x);
}
int main() {
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 1; i <= m; i++) {
    int x, y;
    scanf("%d%d", &x, &y);
    G[x].push_back(y);
  }
  for (int i = 1; i <= n; i++)
    if (!vis[i]) dfs(i);
}
