#include <iostream>
#include <vector>
#include <map>
#include <utility>
#include <queue>
using namespace std;
#define rep2(x,from,to) for(int x=(from);x<(to);++(x))
#define rep(x,to) rep2(x,0,to)

int main() {
	int m,n,x,y;
	cin >> m >> n;
	vector<vector<int> > g(m+1);
	map<int, int> ma;
	rep2(i,1,m+1) {
		ma.insert(make_pair(i,0));
	}
	rep(i,n) {
		cin >> x >> y;
		g[x].push_back(y);
		ma[y]++;
	}
	while(1) {
		bool f = 1;
		for(auto it = ma.begin(); it != ma.end(); ++it) {
			int i = (*it).first, j = (*it).second;
			if(j == 0) {
				cout << i << endl;
				(*it).second--;
				for(int a : g[(*it).first]) {
					ma[a]--;
				}
			} else if(j > 0) {
				f = 0;
			}
		}
		if(f) break;
	}
	return 0;
}