
import java.util.Scanner;
import java.util.Stack;

public class Main {

    public static void main(String[] args) {
        Scanner Input = new Scanner(System.in);
        int N = Input.nextInt();
        int M = Input.nextInt();
        int A[][] = new int[N][N];
        for (int I = 0; I < M; I++) {
            int X = Input.nextInt();
            int Y = Input.nextInt();
            A[X-1][Y-1]++;
            A[Y-1][X-1]++;           
        }

        for (int R = 0; R < A.length; R++) {
            int Ko=0;
            for (int C = 0; C < A[0].length; C++) {
                Ko+=A[R][C];
            }
            System.out.println(Ko);
        }

    }
}

//Learn Before You Earn

/tmp/hf-datasets-cache/medium/datasets/42704881117311-config-parquet-and-info-qiankunmu-Project_CodeNet-896c9d36/hub/datasets--qiankunmu--Project_CodeNet_Python800_and_Java250/snapshots/c899fde44a77ba1cc14973ed3de064e4ff3aadc7/Project_CodeNet_Java250.tar.gz