#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;
}