#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;

queue<int> getNoin( vector<P> g, set<int> node ){
  queue<int> res;
  for(set<int>::iterator it=node.begin(); it!=node.end(); ++it){
    bool isNoin=true;
    for(vector<P>::iterator it2=g.begin(); it2!=g.end(); ++it2){
      if( (*it) == (*it2).second ){
	isNoin = false;
	break;
      }
    }
    if(isNoin)
      res.push(*it);
  }
  return res;
}

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);
  }

  vector<int> res;
  queue<int> noin = getNoin(graph, node);

  while( !noin.empty() ){
    int ni = noin.front(); noin.pop();
    res.PB(ni);

    for(vector<P>::iterator it=graph.begin(); it!=graph.end(); ){
      if( (*it).first == ni )
	it = graph.erase( it );
      else
	++it;
    }
    for(set<int>::iterator it=node.begin(); it!=node.end(); ++it){
      if( (*it) == ni ){
	node.erase( it );
	break;
      }
    }

    if( noin.empty() )
      noin = getNoin(graph,node);
  }
  
  IREP(it,res){
    cout << *it << endl;
  }

  return 0;
}