#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 30 * 1000 + 10;
vector<int> graph[MAX_N];
bool mark[MAX_N];
void DFS(int v) {
  mark[v] = true;
  for (int i = 0; i < graph[v].size(); i++)
    if (!mark[graph[v][i]]) DFS(graph[v][i]);
  cout << v << " ";
}
int main() {
  int n, m;
  cin >> n >> m;
  for (int i = 0; i < m; i++) {
    int a, b;
    cin >> a >> b;
    graph[a].push_back(b);
  }
  for (int i = 1; i <= n; i++)
    if (!mark[i]) DFS(i);
  cout << endl;
  return 0;
}
