#include <iostream>
#include <complex>
#include <sstream>
#include <string>
#include <algorithm>
#include <deque>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <vector>
#include <set>
#include <limits>
#include <cstdio>
#include <cctype>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <ctime>
using namespace std;
#define REP(i, j) for(int i = 0; i < (int)(j); ++i)
#define FOR(i, j, k) for(int i = (int)(j); i < (int)(k); ++i)
#define SORT(v) sort((v).begin(), (v).end())
#define REVERSE(v) reverse((v).begin(), (v).end())
typedef complex<double> P;

bool isEnd(vector<bool> &u){
  REP(i, u.size()) if(!u[i]) return false;
  return true;
}

bool check(int n, vector<bool> &u, vector< vector<int> > &v){
  if(u[n]) return false;
  REP(i, v[n].size()) if(!u[v[n][i]]) return false;
  return true;
}

int main() {
  int N, M; cin >>N >>M;
  vector< vector<int> > v(N);
  REP(i, M){
    int a, b; cin >>a >>b;
    --a; --b;
    v[b].push_back(a);
  }
  vector<bool> used(N, false);
  vector<int> ans;
  while(!isEnd(used)){
    int n = -1;
    REP(i, N) if(check(i, used, v)) n = i;
    used[n] = true;
    ans.push_back(n);
  }
  REP(i, ans.size()) cout <<ans[i] + 1 <<endl;
  return 0;
}