#define _CRT_SECURE_NO_WARNINGS
#include <stdio.h>
typedef struct node
{
	int val;
	node* next;
};
int N, M;
node* vecini[50001];
int viz[50001];
int grad[50001];
void read_data(const char* filename)
{
	FILE* fp = fopen(filename, "r");
	fscanf(fp, "%d%d", &N, &M);
	for (int i = 1; i <= N; i++)
	{
		viz[i] = 0;
		vecini[i] = NULL;
		grad[i] = 0;
	}
	for (int i = 0; i < M; i++)
	{
		int a, b;
		fscanf(fp, "%d%d", &a, &b);
		int ok = 0;
		for (node* p = vecini[a]; p != NULL; p = p->next)
		{
			if (p->val == b)
			{
				ok = 1;
				break;
			}
		}
		if (ok == 0)
		{
			node* nou = new node;
			nou->val = b;
			grad[b]++;
			nou->next = vecini[a];
			vecini[a] = nou;
		}
	}
	fclose(fp);
}
void DFS(int nod,FILE* fout)
{
	fprintf(fout,"%d ", nod);
	viz[nod] = 1;
	for (node* p = vecini[nod]; p != NULL; p = p->next)
	{
		grad[p->val]--;
		if (viz[p->val] == 0)
		{
			DFS(p->val,fout);
		}
	}
}
void topological_sort()
{
	FILE* fout = fopen("sortaret.out", "w");
	for (int i = 1; i <= N; i++)
	{
		if (viz[i] == 0 && grad[i]==0)
		{
			DFS(i,fout);
		}
	}
	fclose(fout);
}
void show_neighbours()
{
	for (int i = 1; i <= N; i++)
	{
		printf("Nodul %d are vecinii : ", i);
		for (node* p = vecini[i]; p != NULL; p = p->next)
		{
			printf("%d ", p->val);
		}
		printf("\n");
	}
}
int main()
{
	read_data("sortaret.in");
	/*for (int i = 1; i <= N; i++)
		printf("%d %d\n",i, grad[i]);*/
	show_neighbours();
	topological_sort();
}