#include <iostream>
#include <fstream>
#include <vector>
constexpr const int NMAX = 5e4+5;
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector < int > g[NMAX];

short viz[NMAX];
int n, m;

void dfs(int nod){
	if(viz[nod] < 1){
		fout << nod << ' ';
		viz[nod] = 1;
	}
	for(int i : g[nod])
		if(!viz[i]){
			viz[i] = -1;
			dfs(i);
		}
}

int main(){
	fin >> n >> m;
	for(int i = 0, x, y; i < m; i++){
		fin >> x >> y;
		g[x].push_back(y);
	}
	fin.close();
	dfs(1);
	fout.close();
	return 0;
}