#include <bits/stdc++.h>
using namespace std;
const int MAX = 1e5 + 10;
vector<int> v[MAX];
bool mark[MAX];
void DFS(int x) {
  if (mark[x] == true) {
    return;
  }
  mark[x] = true;
  for (int i = 0; i < v[x].size(); i++) {
    int child = v[x][i];
    if (!mark[child] && child != x) {
      DFS(child);
      mark[child] = true;
    }
  }
  cout << x << " ";
}
int main() {
  int n, m;
  cin >> n >> m;
  int s, e;
  for (int i = 0; i < m; i++) {
    cin >> s >> e;
    v[s].push_back(e);
  }
  for (int i = 1; i <= n; i++) {
    if (!mark[i]) {
      DFS(i);
    }
  }
}
