#include <iostream>
using namespace std;
int main() {
int n,m;
cin >> n >> m;
int b[10000][10000];
for(int i = 0;i<m;i++) {
int x,y;
cin >> x >> y;
// n is the number of nodes and m is the number of edges
b[x][y] = 1;
b[y][x] = 1;
}
int cnt = 0; //Tells us how many nodes are exactly connected to node i
for(int i = 0;i<n;i++) {
int cnt = 0;
for(int j = 0;j<n;j++) {
if(b[i][j] == 1) cnt++;
}
}
return 0;
}
I2luY2x1ZGUgPGlvc3RyZWFtPgp1c2luZyBuYW1lc3BhY2Ugc3RkOwppbnQgbWFpbigpIHsKICAgIGludCBuLG07CiAgICBjaW4gPj4gbiA+PiBtOwogICAgaW50IGJbMTAwMDBdWzEwMDAwXTsKICAgIGZvcihpbnQgaSA9IDA7aTxtO2krKykgewogICAgICAgIGludCB4LHk7CiAgICAgICAgY2luID4+IHggPj4geTsKICAgICAgICAvLyBuIGlzIHRoZSBudW1iZXIgb2Ygbm9kZXMgYW5kIG0gaXMgdGhlIG51bWJlciBvZiBlZGdlcwogICAgICAgIGJbeF1beV0gPSAxOwogICAgICAgIGJbeV1beF0gPSAxOwogICAgfQogICAgCiAgICBpbnQgY250ID0gMDsgLy9UZWxscyB1cyBob3cgbWFueSBub2RlcyBhcmUgZXhhY3RseSBjb25uZWN0ZWQgdG8gbm9kZSBpCiAgICBmb3IoaW50IGkgPSAwO2k8bjtpKyspIHsKICAgICAgICBpbnQgY250ID0gMDsKICAgICAgICBmb3IoaW50IGogPSAwO2o8bjtqKyspIHsKICAgICAgICAgICAgaWYoYltpXVtqXSA9PSAxKSBjbnQrKzsKICAgICAgICB9CiAgICB9CiAgICByZXR1cm4gMDsKfQ==