снм долгий

#include <iostream>
#include <set>
#include <vector>
#include <deque>

#define se second
#define fi first
#define mp make_pair
#define pb push_back

using namespace std;

vector<int> p;

int get_root(int x) {
    if (p[x] == x) return x;
    return get_root(p[x]);
}

void unite(int x, int y) {
    x = get_root(x);
    y = get_root(y);
    p[x] = y;
}

bool check(int x, int y) {
    return get_root(x) == get_root(y);
}

int main() {
    int n, m;
    cin >> n >> m;
    p.resize(n);
    for (int i = 0; i < n; i++) p[i] = i;
    while (m--) {
        ///
    }
    return 0;
}