//#include "pch.h"
#include <iostream>
#include <fstream>
#include <vector>
#include <string>
#include <algorithm>
#include <climits>
using namespace std;
ifstream f("sortaret.in");
ofstream o("sortaret.out");

vector<int>g[100000];
bool visited[100000];
int v, e;

void dfs(int nod)
{
	for (size_t i = 0; i < g[nod].size(); i++)
	{
		if (visited[g[nod][i]] == false)
		{
			o << g[nod][i] << " ";
			visited[g[nod][i]] = true;
			dfs(g[nod][i]);
		}
	}


}


int main()
{
	f >> v >> e;

	for (size_t i = 0; i < e; i++)
	{
		int x, y;
		f >> x >> y;
		g[x].push_back(y);
	}
	o << "1 ";
	for (size_t i = 1; i <= v; i++)
	{
		if (visited[i] == false)
		{
			dfs(i);
		}
	}

}