#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
const int MAX = 1e5;
vector<int> outro[MAX];
int intro[MAX];
bool vis[MAX];
int main(){
    int v,e;
	cin>>v>>e;
	for(int i=0;i<e;i++){
		int a,b;
		cin>>a>>b;
		outro[a].push_back(b);
		intro[b]++;
	}
	vector<int> can;
	vector<int> ans;
	for(int i=1;i<=v;i++){
		if(intro[i]==0)
			can.push_back(i);	
	}
	while(can.size()){
		vector<int> ncan;
		for(int i=0;i<can.size();i++){
			ans.push_back(can[i]);
			for(int j=outro[can[i]].size()-1;j>=0;j--){
				intro[outro[can[i]][j]]--;
				outro[can[i]].pop_back();
				if(!intro[outro[can[i]][j]])
					ncan.push_back(outro[can[i]][j]);
			}
		}
		can=ncan;
	}
	if(ans.size()==v){
		for(int i=0;i<ans.size();i++)
			cout<<ans[i]<<" ";
		cout<<endl;
	}
	else{
		cout<<"Impossible"<<endl;
	}
	return 0;
}