#include <algorithm>
#include <map>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <string>
#include <queue>
#include <stack>
#include <set>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define IREP(it,array) for(vector<int>::iterator it=array.begin(); it!=array.end(); ++it)
#define SREP(it,array) for(vector<string>::iterator it=array.begin(); it!=array.end(); ++it)

#define MP       make_pair
#define PB       push_back
#define ALL(x)   (x).begin(),(x).end()

const int INF = 1<<29;
const double EPS = 1e-9;
double zero(double d){
  return d < EPS ? 0.0 : d;
}

typedef long long LL;
typedef pair<int,int> P;

void visit(int n, vector<P> g, bool b[], vector<int>& res ){
  if( ! b[n] ){
    b[n] = true;
    for(vector<P>::iterator it=g.begin(); it!=g.end(); ++it){
      if( (*it).first == n )
	visit( (*it).second, g, b, res );
    }
    res.PB(n);
  }
}


int main()
{
  cout.setf(ios::fixed, ios::floatfield);
  cout.precision(7);

  int m,n;
  cin >> m >> n;

  vector<P> graph;
  set<int> node;

  REP(_t,n){
    int x,y;
    cin >> x >> y;
    graph.PB( MP(x,y) );
    node.insert(x);
    node.insert(y);
  }

  bool isVisited[m+1];
  memset(isVisited, 0, sizeof(isVisited));

  vector<int> res;

  for(set<int>::iterator it=node.begin(); it!=node.end(); ++it){
    visit((*it), graph, isVisited, res);
  }
  reverse( ALL(res) );
  IREP(it,res){
    cout << *it << endl;
  }

  return 0;
}