#include <iostream>
#include <queue>
/*

8
9
0 1
1 2
2 3
2 4
3 5
4 6
5 6
5 7
6 7
*/



using namespace std;
//const int n = 8;

void BFS(int **G, int n, int start)
{
	//bool visited[n] = { false };
	bool *visited = new bool[n];
	int *distance = new int[n];
	int *previous = new int[n];
	distance[start] = 0;
	previous[start] = -1;
	for (int i = 0; i < n; i++)
		visited[i] = false;
	/*tak samo jak
	bool visited[n];
	for (int i = 0; i<n;i++)
		visited[i] = false;
	*/
	queue<int> S;
	S.push(start);
	visited[start] = true;
	while (!S.empty())
	{

		cout << start << " ";
		start = S.front();
		for (int u = 0; u < n; u++)
		{
			if (G[start][u] == 1
				&& visited[u] == false)
			{
				distance[u] = distance[start] + 1;
				visited[u] = true;
				S.push(u);
				previous[u] = start;
			}
		}
		S.pop();
	}
	for (int i = 0; i < n; i++)
	{
		cout << "v: " << i << " odleglosc od startu " << distance[i] << endl;
		cout << " dojscie z " << previous[i] << endl;
	}
		delete[] visited;
		delete[] distance;
		delete[] previous;
}

int main()
{
	int n;
	cin >> n;
	//int *G = new int[n];
	int **G = new int*[n];
	for (int i = 0; i < n; i++)
	{
		G[i] = new int[n];
		for (int j = 0; j < n; j++)
			G[i][j] = 0;
	}

	//int G[n][n];

	int m;
	cin >> m;
	for (int i = 0; i < m; i++)
	{
		int a, b;
		cin >> a;
		cin >> b;
		G[a][b] = 1;
		G[b][a] = 1;
	}
	BFS(G,n, 2);

	for (int i = 0; i<n; i++)
		delete[] G[i]; //kasowanie
	delete[] G;


	system("pause");
	return 0;
}