#include <iostream>
#include <fstream>

using namespace std;

int citire(){
int a[1000][1000], n, m, viz[1000], c;

ifstream f ("DFS.in");
ofstream g ("DFS.out");

f >> n >> m;

for(int i = 1; i <= m ; i++)
{
    f >> x >> y;
    a[x][y]=a[y][x]=1;
}
}
void DFS(int nod){

cout<< nod <<" ";

viz[nod]=1;
for(int j=1;j<=n;++j)
    if(a[nod][j]==1)
    DFS(j);




}

int main(){

    citire();

int i;
    for (i = 1; i <= n; i++)
        if (!viz[i])
        { c++;
            DFS(j);
        }

 cout<<c<<" ";


return 0;
}