import java.io.PrintWriter;
import java.util.Scanner;

public class Main {
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int N = Integer.parseInt(sc.next());
        int M = Integer.parseInt(sc.next());
        int[] road = new int[2 * M];
        int[] count = new int[N];

        for (int i = 0; i < 2 * M; i++) {
            road[i] = Integer.parseInt(sc.next());
        }

        for (int i = 0; i < 2 * M; i++) {
            for (int j = 1; j <= N; j++) {
                if (road[i] == j) {
                    count[j - 1]++;
                }
            }
        }

        PrintWriter out = new PrintWriter(System.out);
        for (int i = 0; i < N; i++) {
            out.println(count[i]);
            out.flush();
        }
        sc.close();
    }
}
/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