#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout << #x << " = " << x << endl
#define umap unordered_map
#define uset unordered_set
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
const int INF = 1'000'000'007;
set<ii> ans;
int p[100000];
char r[100000];
int find_set(int i) { return p[i] == i ? i : p[i] = find_set(p[i]); }
void union_set(int i, int j) {
i = find_set(i);
j = find_set(j);
if (i == j) return;
if (r[i] < r[j]) swap(i, j);
if (r[i] == r[j]) ++r[i];
p[j] = i;
}
bitset<17> edges[6000000];
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
int n, m;
cin >> n >> m;
rep(i,0,n){
p[i]=i;
r[i]=0;
}
rep(i, 0, m) {
int u, v;
cin >> u >> v;
--u;
--v;
}
return 0;
}
