#include <bits/stdc++.h>
using namespace std;
int main() {
int n;
cin >> n;
int m;
cin >> m;
vector<int> Graph[n+5];
for(int i=0; i<m; i++) {
int x, y;
cin >> x >> y;
Graph[x].push_back(y);
Graph[y].push_back(x);
}
int src = 1;
int vis[n+5] = {0};
int level[n+5] = {0};
queue<int> q;
q.push(src);
vis[src] = 1;
level[src] = 0;
while(!q.empty()) {
int removed = q.front();
cout << "Removed: " << removed << " Level: " << level[removed] << endl;
q.pop();
for(auto u : Graph[removed]) {
if(vis[u] == 0) {
q.push(u);
vis[u] = 1;
level[u] = level[removed] + 1;
}
}
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpIHsKCWludCBuOwoJY2luID4+IG47CgkKCWludCBtOwoJY2luID4+IG07CgkKCXZlY3RvcjxpbnQ+IEdyYXBoW24rNV07CgkKCWZvcihpbnQgaT0wOyBpPG07IGkrKykgewoJCWludCB4LCB5OwoJCQoJCWNpbiA+PiB4ID4+IHk7CgkJCgkJR3JhcGhbeF0ucHVzaF9iYWNrKHkpOwoJCUdyYXBoW3ldLnB1c2hfYmFjayh4KTsKCX0KCQoJaW50IHNyYyA9IDE7CglpbnQgdmlzW24rNV0gPSB7MH07CglpbnQgbGV2ZWxbbis1XSA9IHswfTsKCQoJcXVldWU8aW50PiBxOwoJCglxLnB1c2goc3JjKTsKCXZpc1tzcmNdID0gMTsKCWxldmVsW3NyY10gPSAwOwoJCgl3aGlsZSghcS5lbXB0eSgpKSB7CgkJaW50IHJlbW92ZWQgPSBxLmZyb250KCk7CgkJCgkJY291dCA8PCAiUmVtb3ZlZDogIiA8PCByZW1vdmVkIDw8ICIgTGV2ZWw6ICIgPDwgbGV2ZWxbcmVtb3ZlZF0gPDwgZW5kbDsKCgkJcS5wb3AoKTsKCQkKCQlmb3IoYXV0byB1IDogR3JhcGhbcmVtb3ZlZF0pIHsKCQkJaWYodmlzW3VdID09IDApIHsKCQkJCXEucHVzaCh1KTsKCQkJCXZpc1t1XSA9IDE7CgkJCQlsZXZlbFt1XSA9IGxldmVsW3JlbW92ZWRdICsgMTsKCQkJfQoJCX0KCX0KCQoJcmV0dXJuIDA7Cn0=