#include <iostream>
#include <deque>
#include <algorithm>
using namespace std;

int g[20][20];
int ideg[20];

int main(){
  int n,m;
  deque<int> s, ans;
  
  cin >> n >> m;
  for (int i=0; i<m; i++){
    int x,y; cin >> x >> y;
    g[x-1][y-1] = 1;
    ideg[y-1]++;
  }
  // initialize S
  for (int i=0; i<n; i++){
    if (ideg[i]==0) s.push_back(i);
  }
  while (s.size()){
    int t;
    t = s.front();
    s.pop_front();
    ans.push_back(t);
    for (int i=0; i<n; i++){
      if (g[t][i]){
        g[t][i] = 0;
        if (--ideg[i] == 0) s.push_back(i);
      }
    }
  }
  while (ans.size()){
    cout << (ans.front() + 1) << endl;
    ans.pop_front();
  }
        
  return 0;
}
