#include <bits/stdc++.h>
using namespace std;
int ans = 0;
int i, j, n, m, k, z, t, x, y;
int a[211111];
int const d = -1e9;
vector<int> v[111111];
void dfs(int i) {
  a[i] = 1;
  for (int j = 0; j < (int)v[i].size(); j++)
    if (a[v[i][j]] == 0) dfs(v[i][j]);
  a[i] = 2;
  printf("%d ", i);
}
int main() {
  scanf("%d%d", &n, &m);
  for (i = 0; i < m; i++) {
    scanf("%d %d", &x, &y);
    v[x].push_back(y);
  }
  for (i = 1; i <= n; i++)
    if (a[i] == 0) dfs(i);
}
