#include <stdio.h>
int main()
{
    int i, j, m, a, b, cur,n, book[101] = { 0 }, e[101][101];
    int que[10001], head, tail;
    scanf("%d %d", &n, &m);
    //初始化二維矩陣
    for (i = 1; i <= n; i++)
        for (j = 1; j <= n; j++)
            if (i == j) e[i][j] = 0;
            else e[i][j] = 99999999;	//我們假設(shè)99999999為x
 
    //讀入頂點(diǎn)之間的邊
    for (i = 1; i <= n; i++)
    {
        scanf("%d %d", &a, &b);
        e[a][b] = 1;
        e[b][a] = 1;	//因?yàn)樵搱D為無向圖
    }
 
    //隊(duì)列初始化
    head = 1;
    tail = 1;
 
    //從1號(hào)頂點(diǎn)出發(fā)，將1號(hào)頂點(diǎn)加入隊(duì)列
    que[tail] = 1;
    tail++;
    book[1] = 1;//標(biāo)記1號(hào)頂點(diǎn)已經(jīng)入列
 
    //當(dāng)隊(duì)列不為空時(shí)循環(huán)
    while (head < tail && tail <= n)
    {
        cur = que[head];  //當(dāng)前正在訪問的頂點(diǎn)編號(hào)
        for (i = 1; i <= n; i++)
        {
            //判斷從頂點(diǎn)cur到頂點(diǎn)i是否有邊，并判斷頂點(diǎn)i是否訪問過
            if (e[cur][i] == 1 && book[i] == 0)
            {
                //如果從頂點(diǎn)cur到頂點(diǎn)i右邊，且頂點(diǎn)i沒有被訪問過，將頂點(diǎn)i入列
                que[tail] = i;
                tail++;
                book[i] = 1; //標(biāo)記表示已經(jīng)訪問過
 
            }
            if (tail > n)  //表示所有點(diǎn)都已經(jīng)訪問過
                break;
        }
 
        head++;
        //注意這個(gè)地方，不要忘記head++后，才能繼續(xù)向下拓展
    }
 
    for (i = 1; i < tail; i++)
        printf("%d",que[i]);
 
 
}