#include<bits/stdc++.h>
using namespace std;

int main(int argc, char *argv[]){
  int m, n, from, to;
  cin >> m >> n;
  queue<int> que;
  vector<vector<int> > in(m);
  vector<vector<int> > out(m);
  for (int i = 0; i < n; i++) {
    cin >> from >> to;
    from--;to--;
    in[to].push_back(from);
    out[from].push_back(to);
  }
  for (int i = 0; i < m; i++) {
    if(in[i].empty()){
      que.push(i);
    }
  }
  vector<int> ans;
  while(!que.empty()){
    int v = que.front();que.pop();
    ans.push_back(v);
    for (int i = 0; i < out[v].size(); i++) {
      int nv = out[v][i];
      for (int j = 0; j < in[nv].size(); j++) {
        if(in[nv][j] == v){
          in[nv].erase(in[nv].begin() + j);
          if(in[nv].empty())que.push(nv);
        }
      }
    }
  }
  for (int i = 0; i < ans.size(); i++) {
    std::cout << ans[i] + 1<< std::endl;
  }
  return 0;
}