#include <cstdio>
#include <vector>
#include <deque>
using namespace std;

vector< pair<int,int> > lista[100005];
vector<int> v;
bool viz[100005];

void eulerian(int nod)
{
	int x=0;
	while(lista[nod].size())
	{
		// daca vecinul nu e vizitat ( adica nu am folosit muchia )
		if( viz[lista[nod].back().first]==0)
		{
			x++; // am macar un nod unde sa merg
			
			viz[lista[nod].back().first]=1; // vizitez vecinul viz[indice]
			//printf("Suntem la nodul : %d si mergem la: %d\n",nod,lista[nod].back().second);
			int next_nod=lista[nod].back().second; // scot
			
			lista[nod].pop_back();
			eulerian(next_nod);
		}
			else
				lista[nod].pop_back();
	}
	if(x) v.push_back(nod); 
		
	return;
}

int main()
{
	int n,m;
	freopen("ciclueuler.in","r", stdin);
	freopen("ciclueuler.out","w", stdout);
	scanf("%d %d",&n,&m);
	for(int i=1;i<=m;i++)
	{
		int x,y;
		scanf("%d %d",&x,&y);
		//printf("%d %d\n",x,y);
		lista[x].push_back(make_pair(i,y));
		lista[y].push_back(make_pair(i,x));
	}
	eulerian(1);
	for(int i=v.size()-1;i>=0;i--)
		printf("%d ",v[i]);
	fclose(stdin);
	fclose(stdout);
	
	return 0;
}