#include <bits/stdc++.h>
using namespace std;
const int MAX = 300000;
int n, m, a, b;
int visited[MAX] = {0};
vector<int> graph[MAX];
vector<int> solution;
void dfs(int u) {
  visited[u] = true;
  for (auto to : graph[u]) {
    if (visited[to] == false) {
      dfs(to);
    }
  }
  solution.push_back(u);
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    cin >> a >> b;
    graph[a].push_back(b);
  }
  for (int i = 1; i <= n; i++) {
    if (visited[i] == false) dfs(i);
  }
  for (auto item : solution) {
    cout << item << " ";
  }
  cout << endl;
}
