#include <bits/stdc++.h>
using namespace std;
const int maxn = 5e5;
vector<int> v[maxn];
bool mark[maxn];
void dfs(int x) {
  mark[x] = 1;
  for (int i = 0; i < v[x].size(); i++) {
    int child = v[x][i];
    if (!mark[child]) dfs(child);
  }
  cout << x << " ";
}
int main() {
  int n, m;
  cin >> n >> m;
  while (m--) {
    int fi, se;
    cin >> fi >> se;
    v[fi].push_back(se);
  }
  for (int i = 1; i <= n; i++)
    if (!mark[i]) dfs(i);
  return 0;
}
