#include <stdio.h>

#define N 100
#define M 100

struct muchie
{
	int x, y;
};

muchie vm[M];

int *la[N];
int n, m, viz[N], nr_vec[N];

void citeste();
void sorteaza();
void dfs(int);

void citeste()
{
	freopen("sortaret.in","r",stdin);
	scanf("%d %d\n",&n,&m);
	int i,x,y;
	for(i = 1 ; i <= m ; ++i)
	{
		scanf("%d %d\n",&(vm[i].x), &(vm[i].y));
		nr_vec[vm[i].y]++;
	}
	fclose(stdin);
	for(i = 1; i <= n; ++i)
	{
		la[i] = new int[nr_vec[i]+1];
		la[i][0] = 0;
	}
	for(i = 1; i <= m; ++i)
	{
		x = vm[i].y;
		y = vm[i].x;
		la[x][0]++;
		la[x][la[x][0]]=y;
	}
}

void sorteaza()
{
	freopen("sortaret.out","w",stdout);
	for(int i=1;i<=n;++i) if(!viz[i]) dfs(i);
	printf("\n");	
	fclose(stdout);
}

void dfs(int x)
{
	viz[x]=1;
	for(int i=1; i<=la[x][0];++i)
		if(!viz[la[x][i]])
			dfs(la[x][i]);
	printf("%d ",x); //adaug la terminare
}

int main()
{
	citeste();
	sorteaza();
	return 0;
}