#include <iostream>
#include <cstdio>
#include <stack>

using namespace std;

bool order[30][30];

stack<int> sta;

int main(){
	
	int m, n;
	
	bool checker;
	
	bool check[30];
	
	cin >> m >> n;
	
	int a, b;
	
	for(int i = 0; i <= m; i++){
		for(int j = 0; j <= m; j++){
			order[i][j] = false;
		}
		check[i] = false;
	}
	
	for(int i = 0; i < n; i++){
		cin >> a >> b;
		order[a][b] = true;
	}
	
	for(int loop = 0; loop < m; loop++){
		for(int i = 1; i <= m; i++){
			checker = false;
			for(int j = 1; j <= m; j++){
				if(order[i][j]){
					break;
				}
				if(j == m && !check[i]){
					sta.push(i);
					check[i] = true;
					for(int k = 1; k <= m; k++){
						order[k][i] = false;
					}
					checker = true;
				}
			}
			if(checker){
				break;
			}
		}
	}
	
	while(!sta.empty()){
		printf("%d\n", sta.top());
		sta.pop();
	}
	
	return 0;
}