import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int V = sc.nextInt(); //頂点
		int edge = sc.nextInt(); //辺

		int[] masterNodeList = new int[V];
		ArrayDeque<Integer> noticeQueue = new ArrayDeque<Integer>();
		List<Integer>[] edgeList = new ArrayList[V + 1]; //各nodeが持つedgeを集約する

		for (int i = 0; i < edgeList.length; i++) {
			edgeList[i] = new ArrayList<Integer>();
		}

		//辺をノードごとに集約
		for (int i = 0; i < edge; i++) {
			int edge_a = sc.nextInt();
			int edge_b = sc.nextInt();
			edgeList[edge_a].add(edge_b);
			edgeList[edge_b].add(edge_a);
		}

		for (int i = 1; i < edgeList.length; i++) {
			List<Integer> list = edgeList[i];
			System.out.println(list.size());
		}

	}
}
 import java.util.ArrayDeque; ArrayDeque java.util import java.util.ArrayList; ArrayList java.util import java.util.List; List java.util import java.util.Scanner; Scanner java.util public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int V = sc.nextInt(); //頂点
		int edge = sc.nextInt(); //辺

		int[] masterNodeList = new int[V];
		ArrayDeque<Integer> noticeQueue = new ArrayDeque<Integer>();
		List<Integer>[] edgeList = new ArrayList[V + 1]; //各nodeが持つedgeを集約する

		for (int i = 0; i < edgeList.length; i++) {
			edgeList[i] = new ArrayList<Integer>();
		}

		//辺をノードごとに集約
		for (int i = 0; i < edge; i++) {
			int edge_a = sc.nextInt();
			int edge_b = sc.nextInt();
			edgeList[edge_a].add(edge_b);
			edgeList[edge_b].add(edge_a);
		}

		for (int i = 1; i < edgeList.length; i++) {
			List<Integer> list = edgeList[i];
			System.out.println(list.size());
		}

	}
} Main public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int V = sc.nextInt(); //頂点
		int edge = sc.nextInt(); //辺

		int[] masterNodeList = new int[V];
		ArrayDeque<Integer> noticeQueue = new ArrayDeque<Integer>();
		List<Integer>[] edgeList = new ArrayList[V + 1]; //各nodeが持つedgeを集約する

		for (int i = 0; i < edgeList.length; i++) {
			edgeList[i] = new ArrayList<Integer>();
		}

		//辺をノードごとに集約
		for (int i = 0; i < edge; i++) {
			int edge_a = sc.nextInt();
			int edge_b = sc.nextInt();
			edgeList[edge_a].add(edge_b);
			edgeList[edge_b].add(edge_a);
		}

		for (int i = 1; i < edgeList.length; i++) {
			List<Integer> list = edgeList[i];
			System.out.println(list.size());
		}

	} main {
		Scanner sc = new Scanner(System.in);

		int V = sc.nextInt(); //頂点
		int edge = sc.nextInt(); //辺

		int[] masterNodeList = new int[V];
		ArrayDeque<Integer> noticeQueue = new ArrayDeque<Integer>();
		List<Integer>[] edgeList = new ArrayList[V + 1]; //各nodeが持つedgeを集約する

		for (int i = 0; i < edgeList.length; i++) {
			edgeList[i] = new ArrayList<Integer>();
		}

		//辺をノードごとに集約
		for (int i = 0; i < edge; i++) {
			int edge_a = sc.nextInt();
			int edge_b = sc.nextInt();
			edgeList[edge_a].add(edge_b);
			edgeList[edge_b].add(edge_a);
		}

		for (int i = 1; i < edgeList.length; i++) {
			List<Integer> list = edgeList[i];
			System.out.println(list.size());
		}

	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int V = sc.nextInt(); V sc.nextInt() sc.nextInt sc int edge = sc.nextInt(); edge sc.nextInt() sc.nextInt sc int[] masterNodeList = new int[V]; masterNodeList new int[V] V ArrayDeque<Integer> noticeQueue = new ArrayDeque<Integer>(); noticeQueue new ArrayDeque<Integer>() List<Integer>[] edgeList = new ArrayList[V + 1]; edgeList new ArrayList[V + 1] V + 1 V 1 for (int i = 0; i < edgeList.length; i++) {
			edgeList[i] = new ArrayList<Integer>();
		} int i = 0; int i = 0; i 0 i < edgeList.length i edgeList.length edgeList edgeList.length i++ i++ i {
			edgeList[i] = new ArrayList<Integer>();
		} {
			edgeList[i] = new ArrayList<Integer>();
		} edgeList[i] = new ArrayList<Integer>() edgeList[i] edgeList i new ArrayList<Integer>() for (int i = 0; i < edge; i++) {
			int edge_a = sc.nextInt();
			int edge_b = sc.nextInt();
			edgeList[edge_a].add(edge_b);
			edgeList[edge_b].add(edge_a);
		} int i = 0; int i = 0; i 0 i < edge i edge i++ i++ i {
			int edge_a = sc.nextInt();
			int edge_b = sc.nextInt();
			edgeList[edge_a].add(edge_b);
			edgeList[edge_b].add(edge_a);
		} {
			int edge_a = sc.nextInt();
			int edge_b = sc.nextInt();
			edgeList[edge_a].add(edge_b);
			edgeList[edge_b].add(edge_a);
		} int edge_a = sc.nextInt(); edge_a sc.nextInt() sc.nextInt sc int edge_b = sc.nextInt(); edge_b sc.nextInt() sc.nextInt sc edgeList[edge_a].add(edge_b) edgeList[edge_a].add edgeList[edge_a] edgeList edge_a edge_b edgeList[edge_b].add(edge_a) edgeList[edge_b].add edgeList[edge_b] edgeList edge_b edge_a for (int i = 1; i < edgeList.length; i++) {
			List<Integer> list = edgeList[i];
			System.out.println(list.size());
		} int i = 1; int i = 1; i 1 i < edgeList.length i edgeList.length edgeList edgeList.length i++ i++ i {
			List<Integer> list = edgeList[i];
			System.out.println(list.size());
		} {
			List<Integer> list = edgeList[i];
			System.out.println(list.size());
		} List<Integer> list = edgeList[i]; list edgeList[i] edgeList i System.out.println(list.size()) System.out.println System.out System System.out list.size() list.size list String[] args args public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int V = sc.nextInt(); //頂点
		int edge = sc.nextInt(); //辺

		int[] masterNodeList = new int[V];
		ArrayDeque<Integer> noticeQueue = new ArrayDeque<Integer>();
		List<Integer>[] edgeList = new ArrayList[V + 1]; //各nodeが持つedgeを集約する

		for (int i = 0; i < edgeList.length; i++) {
			edgeList[i] = new ArrayList<Integer>();
		}

		//辺をノードごとに集約
		for (int i = 0; i < edge; i++) {
			int edge_a = sc.nextInt();
			int edge_b = sc.nextInt();
			edgeList[edge_a].add(edge_b);
			edgeList[edge_b].add(edge_a);
		}

		for (int i = 1; i < edgeList.length; i++) {
			List<Integer> list = edgeList[i];
			System.out.println(list.size());
		}

	}
} public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int V = sc.nextInt(); //頂点
		int edge = sc.nextInt(); //辺

		int[] masterNodeList = new int[V];
		ArrayDeque<Integer> noticeQueue = new ArrayDeque<Integer>();
		List<Integer>[] edgeList = new ArrayList[V + 1]; //各nodeが持つedgeを集約する

		for (int i = 0; i < edgeList.length; i++) {
			edgeList[i] = new ArrayList<Integer>();
		}

		//辺をノードごとに集約
		for (int i = 0; i < edge; i++) {
			int edge_a = sc.nextInt();
			int edge_b = sc.nextInt();
			edgeList[edge_a].add(edge_b);
			edgeList[edge_b].add(edge_a);
		}

		for (int i = 1; i < edgeList.length; i++) {
			List<Integer> list = edgeList[i];
			System.out.println(list.size());
		}

	}
} Main
import java.util.ArrayDeque;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class Main {

	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);

		int V = sc.nextInt(); //頂点
		int edge = sc.nextInt(); //辺

		int[] masterNodeList = new int[V];
		ArrayDeque<Integer> noticeQueue = new ArrayDeque<Integer>();
		List<Integer>[] edgeList = new ArrayList[V + 1]; //各nodeが持つedgeを集約する

		for (int i = 0; i < edgeList.length; i++) {
			edgeList[i] = new ArrayList<Integer>();
		}

		//辺をノードごとに集約
		for (int i = 0; i < edge; i++) {
			int edge_a = sc.nextInt();
			int edge_b = sc.nextInt();
			edgeList[edge_a].add(edge_b);
			edgeList[edge_b].add(edge_a);
		}

		for (int i = 1; i < edgeList.length; i++) {
			List<Integer> list = edgeList[i];
			System.out.println(list.size());
		}

	}
}

