#include <cstdio>
#include <vector>
#include <algorithm>

#define rep(i,n) for(int i=0;i<(n);i++)

using namespace std;

int main(){
	int n,m; scanf("%d%d",&n,&m);
	vector<int> G[20];
	int deg[20]={};
	rep(i,m){
		int u,v; scanf("%d%d",&u,&v); u--; v--;
		G[u].push_back(v);
		deg[v]++;
	}

	vector<int> ans;
	bool vis[20]={};
	while(count(vis,vis+n,false)>0){
		rep(u,n) if(!vis[u] && deg[u]==0) {
			vis[u]=true;
			rep(i,G[u].size()){
				int v=G[u][i];
				deg[v]--;
			}
			if(u!=1) ans.push_back(u);
		}
	}
	ans.push_back(1);

	rep(u,n) printf("%d%c",ans[u]+1,u<n-1?' ':'\n');

	return 0;
}