#include <bits/stdc++.h>
using namespace std;
int graph[10000][10000];
int main() {
int n, m;
cin >> n >> m;
for(int i=0; i<m; i++) {
// taking input of undirected graph
int x, y;
cin >> x >> y;
graph[x][y] = 1;
graph[y][x] = 1;
}
for(int i=0; i<n; i++) {
int c = 0;
for(int j=0; j<n; j++) {
if(graph[i][j] == 1) {
c++;
}
}
cout << i << " " << c << endl;
}
return 0;
}
I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgZ3JhcGhbMTAwMDBdWzEwMDAwXTsKCmludCBtYWluKCkgewoJaW50IG4sIG07CgljaW4gPj4gbiA+PiBtOwoJCglmb3IoaW50IGk9MDsgaTxtOyBpKyspIHsKCQkvLyB0YWtpbmcgaW5wdXQgb2YgdW5kaXJlY3RlZCBncmFwaAoJCWludCB4LCB5OwoJCWNpbiA+PiB4ID4+IHk7CgkJCgkJZ3JhcGhbeF1beV0gPSAxOwoJCWdyYXBoW3ldW3hdID0gMTsKCX0KCQoJZm9yKGludCBpPTA7IGk8bjsgaSsrKSB7CgkJaW50IGMgPSAwOwoJCWZvcihpbnQgaj0wOyBqPG47IGorKykgewoJCQlpZihncmFwaFtpXVtqXSA9PSAxKSB7CgkJCQljKys7CgkJCX0KCQl9CgkJY291dCA8PCBpIDw8ICIgIiA8PCBjIDw8IGVuZGw7Cgl9CglyZXR1cm4gMDsKfQ==