#include<stdio.h>
#include<vector>
#include<stack>
using namespace std;

vector <int> muchii[50000];
stack <int> lista_finala;
int grad_viz[50000];

int numar_noduri, numar_muchii;

void df(int nod){
	grad_viz[nod]=-1;
	for(unsigned int i=0;i<muchii[nod].size();i++)
		if(grad_viz[muchii[nod][i]]!=-1)
			df(muchii[nod][i]);
	
	lista_finala.push(nod);
}

int main(){
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	scanf("%d", &numar_noduri);
	scanf("%d", &numar_muchii);
	int x,y;
	for(int i=1;i<=numar_muchii;i++){
		scanf("%d", &x);
		scanf("%d", &y);
		muchii[x].push_back(y);
		++grad_viz[y];
	}
	int min=grad_viz[1];
	int p=1;
	for(int i=2;i<=numar_noduri;i++)
		if(min>grad_viz[i]){
			min=grad_viz[i];
			p=i;
		}
		
	df(p);
	
	while(!lista_finala.empty()){
		printf("%d " , lista_finala.top());
		lista_finala.pop();
	}
	
	return 0;
}