
import java.io.IOException;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) throws IOException {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = 0, m = 0;
		int i = 0, j = 0;
		n = sc.nextInt();
		m = sc.nextInt();
		int Ln1[] = new int[m];
		int Ln2[] = new int[m];
		int Ln[] = new int[n];

		for (i = 0; i < m; i++) {
			Ln1[i] = sc.nextInt();
			Ln2[i] = sc.nextInt();
		}
		for (i = 0; i < m; i++) {
			for (j = 1; j <= n; j++)
				if (j == Ln1[i])
					Ln[j - 1]++;
			for (j = 1; j <= n; j++)
				if (j == Ln2[i])
					Ln[j - 1]++;
		}

		for (i = 0; i < n; i++)
			System.out.println(Ln[i]);

	}

} import java.io.IOException; IOException java.io import java.util.Scanner; Scanner java.util public class Main {

	public static void main(String[] args) throws IOException {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = 0, m = 0;
		int i = 0, j = 0;
		n = sc.nextInt();
		m = sc.nextInt();
		int Ln1[] = new int[m];
		int Ln2[] = new int[m];
		int Ln[] = new int[n];

		for (i = 0; i < m; i++) {
			Ln1[i] = sc.nextInt();
			Ln2[i] = sc.nextInt();
		}
		for (i = 0; i < m; i++) {
			for (j = 1; j <= n; j++)
				if (j == Ln1[i])
					Ln[j - 1]++;
			for (j = 1; j <= n; j++)
				if (j == Ln2[i])
					Ln[j - 1]++;
		}

		for (i = 0; i < n; i++)
			System.out.println(Ln[i]);

	}

} Main public static void main(String[] args) throws IOException {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = 0, m = 0;
		int i = 0, j = 0;
		n = sc.nextInt();
		m = sc.nextInt();
		int Ln1[] = new int[m];
		int Ln2[] = new int[m];
		int Ln[] = new int[n];

		for (i = 0; i < m; i++) {
			Ln1[i] = sc.nextInt();
			Ln2[i] = sc.nextInt();
		}
		for (i = 0; i < m; i++) {
			for (j = 1; j <= n; j++)
				if (j == Ln1[i])
					Ln[j - 1]++;
			for (j = 1; j <= n; j++)
				if (j == Ln2[i])
					Ln[j - 1]++;
		}

		for (i = 0; i < n; i++)
			System.out.println(Ln[i]);

	} main {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = 0, m = 0;
		int i = 0, j = 0;
		n = sc.nextInt();
		m = sc.nextInt();
		int Ln1[] = new int[m];
		int Ln2[] = new int[m];
		int Ln[] = new int[n];

		for (i = 0; i < m; i++) {
			Ln1[i] = sc.nextInt();
			Ln2[i] = sc.nextInt();
		}
		for (i = 0; i < m; i++) {
			for (j = 1; j <= n; j++)
				if (j == Ln1[i])
					Ln[j - 1]++;
			for (j = 1; j <= n; j++)
				if (j == Ln2[i])
					Ln[j - 1]++;
		}

		for (i = 0; i < n; i++)
			System.out.println(Ln[i]);

	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int n = 0 n 0 m = 0; m 0 int i = 0 i 0 j = 0; j 0 n = sc.nextInt() n sc.nextInt() sc.nextInt sc m = sc.nextInt() m sc.nextInt() sc.nextInt sc int Ln1[] = new int[m]; Ln1 new int[m] m int Ln2[] = new int[m]; Ln2 new int[m] m int Ln[] = new int[n]; Ln new int[n] n for (i = 0; i < m; i++) {
			Ln1[i] = sc.nextInt();
			Ln2[i] = sc.nextInt();
		} i = 0; i = 0 i 0 i < m i m i++ i++ i {
			Ln1[i] = sc.nextInt();
			Ln2[i] = sc.nextInt();
		} {
			Ln1[i] = sc.nextInt();
			Ln2[i] = sc.nextInt();
		} Ln1[i] = sc.nextInt() Ln1[i] Ln1 i sc.nextInt() sc.nextInt sc Ln2[i] = sc.nextInt() Ln2[i] Ln2 i sc.nextInt() sc.nextInt sc for (i = 0; i < m; i++) {
			for (j = 1; j <= n; j++)
				if (j == Ln1[i])
					Ln[j - 1]++;
			for (j = 1; j <= n; j++)
				if (j == Ln2[i])
					Ln[j - 1]++;
		} i = 0; i = 0 i 0 i < m i m i++ i++ i {
			for (j = 1; j <= n; j++)
				if (j == Ln1[i])
					Ln[j - 1]++;
			for (j = 1; j <= n; j++)
				if (j == Ln2[i])
					Ln[j - 1]++;
		} {
			for (j = 1; j <= n; j++)
				if (j == Ln1[i])
					Ln[j - 1]++;
			for (j = 1; j <= n; j++)
				if (j == Ln2[i])
					Ln[j - 1]++;
		} for (j = 1; j <= n; j++)
				if (j == Ln1[i])
					Ln[j - 1]++; j = 1; j = 1 j 1 j <= n j n j++ j++ j if (j == Ln1[i])
					Ln[j - 1]++; if (j == Ln1[i])
					Ln[j - 1]++; j == Ln1[i] j Ln1[i] Ln1 i Ln[j - 1]++ Ln[j - 1] Ln j - 1 j 1 for (j = 1; j <= n; j++)
				if (j == Ln2[i])
					Ln[j - 1]++; j = 1; j = 1 j 1 j <= n j n j++ j++ j if (j == Ln2[i])
					Ln[j - 1]++; if (j == Ln2[i])
					Ln[j - 1]++; j == Ln2[i] j Ln2[i] Ln2 i Ln[j - 1]++ Ln[j - 1] Ln j - 1 j 1 for (i = 0; i < n; i++)
			System.out.println(Ln[i]); i = 0; i = 0 i 0 i < n i n i++ i++ i System.out.println(Ln[i]); System.out.println(Ln[i]) System.out.println System.out System System.out Ln[i] Ln i String[] args args public class Main {

	public static void main(String[] args) throws IOException {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = 0, m = 0;
		int i = 0, j = 0;
		n = sc.nextInt();
		m = sc.nextInt();
		int Ln1[] = new int[m];
		int Ln2[] = new int[m];
		int Ln[] = new int[n];

		for (i = 0; i < m; i++) {
			Ln1[i] = sc.nextInt();
			Ln2[i] = sc.nextInt();
		}
		for (i = 0; i < m; i++) {
			for (j = 1; j <= n; j++)
				if (j == Ln1[i])
					Ln[j - 1]++;
			for (j = 1; j <= n; j++)
				if (j == Ln2[i])
					Ln[j - 1]++;
		}

		for (i = 0; i < n; i++)
			System.out.println(Ln[i]);

	}

} public class Main {

	public static void main(String[] args) throws IOException {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = 0, m = 0;
		int i = 0, j = 0;
		n = sc.nextInt();
		m = sc.nextInt();
		int Ln1[] = new int[m];
		int Ln2[] = new int[m];
		int Ln[] = new int[n];

		for (i = 0; i < m; i++) {
			Ln1[i] = sc.nextInt();
			Ln2[i] = sc.nextInt();
		}
		for (i = 0; i < m; i++) {
			for (j = 1; j <= n; j++)
				if (j == Ln1[i])
					Ln[j - 1]++;
			for (j = 1; j <= n; j++)
				if (j == Ln2[i])
					Ln[j - 1]++;
		}

		for (i = 0; i < n; i++)
			System.out.println(Ln[i]);

	}

} Main

import java.io.IOException;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) throws IOException {
		// TODO 自動生成されたメソッド・スタブ
		Scanner sc = new Scanner(System.in);
		int n = 0, m = 0;
		int i = 0, j = 0;
		n = sc.nextInt();
		m = sc.nextInt();
		int Ln1[] = new int[m];
		int Ln2[] = new int[m];
		int Ln[] = new int[n];

		for (i = 0; i < m; i++) {
			Ln1[i] = sc.nextInt();
			Ln2[i] = sc.nextInt();
		}
		for (i = 0; i < m; i++) {
			for (j = 1; j <= n; j++)
				if (j == Ln1[i])
					Ln[j - 1]++;
			for (j = 1; j <= n; j++)
				if (j == Ln2[i])
					Ln[j - 1]++;
		}

		for (i = 0; i < n; i++)
			System.out.println(Ln[i]);

	}

}
