#include <bits/stdc++.h>

using namespace std;

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

const int NM = 5e4 + 5;

vector<int>g[NM], ans;
int n, m;
bool used[NM];

void dfs (int nod){
  used[nod] = true;
  for (int u : g[nod]){
    if (used[u] == false){
      dfs(u);
    }
  }
  ans.push_back(nod);
}

int main(){
  fin >> n >> m;
  for (int i = 1; i <= m; i++){
    int x, y; fin >> x >> y;
    g[x].push_back(y);
  }
  for (int i = 1; i <= n; i++){
    if (used[i] == false){
      dfs(i);
    }
  }
  reverse(ans.begin(), ans.end());
  for (int x : ans){
    fout << x << " ";
  }
}