#include<iostream>
#include<vector>
using namespace std;


vector<int> topologicalSort(int v,const vector<int> edge[]){
	vector<int> zeros;
	vector<int> in(v),res;
	for(int i=0;i<v;i++){
		for(int j=0;j<(int)edge[i].size();j++)in[edge[i][j]]++;
	}
	for(int i=0;i<v;i++)if(in[i]==0)zeros.push_back(i);
	while(!zeros.empty()){
		int u=zeros.back();
		zeros.pop_back();
		res.push_back(u);
		for(int i=0;i<(int)edge[u].size();i++){
			if(--in[edge[u][i]]==0)zeros.push_back(edge[u][i]);
		}
	}
	return res;
}


int main(){
	vector<int> edge[20];
	int n,m;
	cin>>n>>m;
	for(int i=0;i<m;i++){
		int x,y;
		cin>>x>>y;
		x--;y--;
		edge[x].push_back(y);
	}
	vector<int> order(topologicalSort(n,edge));
	for(int i=0;i<n;i++)cout<<order[i]+1<<endl;
	return 0;
}