#include <fstream>
#include <iostream>
#include <vector>
using namespace std;

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

vector <int> G[100005];
int Use[100005];
int N,M;

void DFS(int Nod)
{
Use[Nod] = 1;
fout<<Nod<<" ";
for(unsigned int i=0;i<G[Nod].size();i++)
{
    int Vecin=G[Nod][i];
    if(!Use[Vecin])
        DFS(Vecin);
}
}

void Read()
{
    fin>>N>>M;
    for(int i=1;i<=M;i++)
        {
            int x,y;
            fin>>x>>y;
            G[x].push_back(y);
            G[y].push_back(x);
        }
}

void Print()
{
for(int i=1;i<=N;i++)
 {
 fout<<"Lista lui "<<i<<": ";
 for(unsigned int j=0;j<G[i].size();j++)
    fout<<G[i][j]<<" ";
 fout<<"\n";
 }
}

int main()
{
    Read();
    DFS(1);
    Print();
    return 0;
}