#include <iostream>
#include <vector>

using namespace std;

void dfs(int nod, vector <int> graph[], vector <int> &viz)
{
    viz[nod] = 1;
    int lim = graph[nod].size();
    for(int i = 0; i < lim; ++i)
    {
        int vecin = graph[nod][i];
        if(!vecin)
            dfs(vecin, graph, viz);
    }
}

int main()
{
    int n, m;
    cin >> n >> m;
    vector <int> graph[n + 5];
    for(int i = 0; i < m; ++i)
    {
        int a, b;
        cin >> a >> b;
        graph[a].push_back(b);
        graph[b].push_back(a);
    }

    vector <int> viz;
    viz.resize(n);

    for(int i = 0; i < n; ++i)
        if(viz[i] == 0)
    {
        dfs(i, graph, viz);
    }

    return 0;
}