#include <iostream>
#include <fstream>
#include <vector>

std::vector<std::vector<int>>adiacenta;
std::vector<int> sortare;
std::vector<bool> vizitat;
int n, m;
int contor = 0;

void citire()
{
	int x, y;
	std::ifstream f("sortaret.in");
	f >> n >> m;
	adiacenta.resize(n + 1);
	sortare.resize(n + 2);
	vizitat.resize(n + 1, false);
	for (int i = 1; i <= n; i++)
	{
		f >> x >> y;
		adiacenta[x].push_back(y);
	}
}

void DFS(int nod)
{
	vizitat[nod] = true;
	for (int i = 0; i < adiacenta[nod].size(); i++)
	{
		if (vizitat[adiacenta[nod][i]] == false)
		{
			DFS(adiacenta[nod][i]);
		}
	}
	sortare[++contor] = nod;
}

void afisare()
{
	std::ofstream g("sortaret.out");
	for (int i = contor ; i > 0 ; i--)
	{
		g << sortare[i] << " ";
	}
		
}

int main()
{
	citire();
	for (int i = 1; i <= n; i++)
	{
		if (vizitat[i] == false)
		{
			DFS(i);
		}
	}
	afisare();


	return 0;
}