// https://infoarena.ro/problema/sortaret
#include <bits/stdc++.h>
using namespace std;
#define endl '\n'

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

const int MAXN=50005;
bool viz[MAXN];
vector<int> order{}, adj[MAXN];

void dfs(int x) {
  viz[x] = true;
  for (int y:adj[x]) {
    if (!viz[y]) dfs(y);
  }
  order.push_back(x);
}

int main() {
  int n, m;
  fin>>n>>m;

  for (int i=0; i<m; ++i) {
    int x, y;
    fin>>x>>y;
    adj[x].push_back(y);
  }

  for (int i=1; i<=n; ++i) {
    if (!viz[i]) dfs(i);
  }
  reverse(order.begin(), order.end());
  
  for (int x:order) fout<<x<<" ";
}