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

#define for_(i,a,b) for(int i=(a);i<(b);++i)

int main() {
	int m, n;
	cin >> m >> n;
	
	vector< int > deg(m, 0);
	vector< vector< int > > adj(m, vector< int >());
	
	for_(i,0,n) {
		int x, y;
		cin >> x >> y;
		--x; --y;
		
		++deg[y];
		adj[x].push_back(y);
	}
	
	queue< int > que;
	for_(i,0,m) if (deg[i] == 0) que.push(i);
	
	vector< int > order;
	
	while (!que.empty()) {
		int v = que.front(); que.pop();
		order.push_back(v);
		
		int adj_num = (int)adj[v].size();
		for_(i,0,adj_num) {
			int u = adj[v][i];
			--deg[u];
			if (deg[u] == 0) que.push(u);
		}
	}
	
	for_(i,0,m) cout << order[i] + 1 << endl;
}