#include <cstdio>
#include <vector>

using namespace std;

#define file_in "sortaret.in"
#define file_out "sortaret.out"

#define Nmax 122132

vector<int> G[Nmax];
int n,m;
int viz[Nmax];
int nr,ord[Nmax];

void dfs(int nod)
{
	if (viz[nod])
		return ;
	
	viz[nod]=1;
	ord[++nr]=nod;
	for (int i=0;i<G[nod].size();++i)
		 if (!viz[G[nod][i]])
			 dfs(G[nod][i]);
}

int main()
{
	int i,a,b;
	freopen(file_in,"r",stdin);
	freopen(file_out,"w",stdout);
	
	scanf("%d %d", &n, &m);
	
	while(m--)
	{
		scanf("%d %d", &a, &b);
		
		G[a].push_back(b);
		G[b].push_back(a);
		
	}
	
	
	for (i=1;i<=n;++i)
		 if (!viz[i])
			 dfs(i);
		 
	for (i=1;i<=n;++i)
         printf("%d ", ord[i]);

	fclose(stdin);
	fclose(stdout);
		 
	
	return 0;
	
}