#include <bits/stdc++.h>
using namespace std;
const int MAX = 1 << 17;
bool vis[MAX];
vector<int> edges[MAX];
vector<vector<int> > lst;
int in[MAX], out[MAX], c;
void dfs(int i) {
  vis[i] = 1;
  for (int j = 0; j < (int)(edges[i].size()); j++) {
    int v = edges[i][j];
    if (vis[v]) continue;
    dfs(v);
  }
  lst[c].push_back(i + 1);
}
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int u, v;
    cin >> u >> v;
    --u, --v;
    edges[v].push_back(u);
    in[u]++;
    out[v]++;
  }
  c = -1;
  for (int i = 0; i < n; i++) {
    if (in[i] == 0) {
      ++c;
      lst.push_back(vector<int>());
      dfs(i);
      reverse(lst[c].begin(), lst[c].end());
    }
  }
  for (int i = 0; i < n; i++) {
    if (vis[i]) continue;
    if (out[i] != 0) {
      ++c;
      lst.push_back(vector<int>());
      dfs(i);
      reverse(lst[c].begin(), lst[c].end());
    }
  }
  for (int i = 0; i < (int)(lst.size()); i++) {
    for (int j = 0; j < (int)(lst[i].size()); j++) cout << lst[i][j] << ' ';
  }
  for (int i = 0; i < n; i++)
    if (!vis[i]) cout << i + 1 << ' ';
  return 0;
}
