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

/**
 * https://abc061.contest.atcoder.jp/tasks/abc061_b
 */
public class Main {

	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		Node[] nodes = new Node[N];
		for(int i=0; i<N; i++) nodes[i] = new Node();
		for(int i=0; i<M; i++){
			Node a = nodes[sc.nextInt()-1];
			Node b = nodes[sc.nextInt()-1];
			a.neighbor.add(b);
			b.neighbor.add(a);
		}
		sc.close();
		
		for(Node n:nodes){
			System.out.println(n.neighbor.size());
		}

	}
	
	static class Node{
		List<Node> neighbor = new ArrayList<>();
	}

} 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 N = sc.nextInt();
		int M = sc.nextInt();
		Node[] nodes = new Node[N];
		for(int i=0; i<N; i++) nodes[i] = new Node();
		for(int i=0; i<M; i++){
			Node a = nodes[sc.nextInt()-1];
			Node b = nodes[sc.nextInt()-1];
			a.neighbor.add(b);
			b.neighbor.add(a);
		}
		sc.close();
		
		for(Node n:nodes){
			System.out.println(n.neighbor.size());
		}

	}
	
	static class Node{
		List<Node> neighbor = new ArrayList<>();
	}

} Main public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		Node[] nodes = new Node[N];
		for(int i=0; i<N; i++) nodes[i] = new Node();
		for(int i=0; i<M; i++){
			Node a = nodes[sc.nextInt()-1];
			Node b = nodes[sc.nextInt()-1];
			a.neighbor.add(b);
			b.neighbor.add(a);
		}
		sc.close();
		
		for(Node n:nodes){
			System.out.println(n.neighbor.size());
		}

	} main {
		
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		Node[] nodes = new Node[N];
		for(int i=0; i<N; i++) nodes[i] = new Node();
		for(int i=0; i<M; i++){
			Node a = nodes[sc.nextInt()-1];
			Node b = nodes[sc.nextInt()-1];
			a.neighbor.add(b);
			b.neighbor.add(a);
		}
		sc.close();
		
		for(Node n:nodes){
			System.out.println(n.neighbor.size());
		}

	} Scanner sc = new Scanner(System.in); sc new Scanner(System.in) int N = sc.nextInt(); N sc.nextInt() sc.nextInt sc int M = sc.nextInt(); M sc.nextInt() sc.nextInt sc Node[] nodes = new Node[N]; nodes new Node[N] N for(int i=0; i<N; i++) nodes[i] = new Node(); int i=0; int i=0; i 0 i<N i N i++ i++ i nodes[i] = new Node(); nodes[i] = new Node() nodes[i] nodes i new Node() for(int i=0; i<M; i++){
			Node a = nodes[sc.nextInt()-1];
			Node b = nodes[sc.nextInt()-1];
			a.neighbor.add(b);
			b.neighbor.add(a);
		} int i=0; int i=0; i 0 i<M i M i++ i++ i {
			Node a = nodes[sc.nextInt()-1];
			Node b = nodes[sc.nextInt()-1];
			a.neighbor.add(b);
			b.neighbor.add(a);
		} {
			Node a = nodes[sc.nextInt()-1];
			Node b = nodes[sc.nextInt()-1];
			a.neighbor.add(b);
			b.neighbor.add(a);
		} Node a = nodes[sc.nextInt()-1]; a nodes[sc.nextInt()-1] nodes sc.nextInt()-1 sc.nextInt() sc.nextInt sc 1 Node b = nodes[sc.nextInt()-1]; b nodes[sc.nextInt()-1] nodes sc.nextInt()-1 sc.nextInt() sc.nextInt sc 1 a.neighbor.add(b) a.neighbor.add a.neighbor a a.neighbor b b.neighbor.add(a) b.neighbor.add b.neighbor b b.neighbor a sc.close() sc.close sc for(Node n:nodes){
			System.out.println(n.neighbor.size());
		} Node n nodes {
			System.out.println(n.neighbor.size());
		} {
			System.out.println(n.neighbor.size());
		} System.out.println(n.neighbor.size()) System.out.println System.out System System.out n.neighbor.size() n.neighbor.size n.neighbor n n.neighbor String[] args args static class Node{
		List<Node> neighbor = new ArrayList<>();
	} Node List<Node> neighbor = new ArrayList<>(); neighbor new ArrayList<>() public class Main {

	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		Node[] nodes = new Node[N];
		for(int i=0; i<N; i++) nodes[i] = new Node();
		for(int i=0; i<M; i++){
			Node a = nodes[sc.nextInt()-1];
			Node b = nodes[sc.nextInt()-1];
			a.neighbor.add(b);
			b.neighbor.add(a);
		}
		sc.close();
		
		for(Node n:nodes){
			System.out.println(n.neighbor.size());
		}

	}
	
	static class Node{
		List<Node> neighbor = new ArrayList<>();
	}

} public class Main {

	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		Node[] nodes = new Node[N];
		for(int i=0; i<N; i++) nodes[i] = new Node();
		for(int i=0; i<M; i++){
			Node a = nodes[sc.nextInt()-1];
			Node b = nodes[sc.nextInt()-1];
			a.neighbor.add(b);
			b.neighbor.add(a);
		}
		sc.close();
		
		for(Node n:nodes){
			System.out.println(n.neighbor.size());
		}

	}
	
	static class Node{
		List<Node> neighbor = new ArrayList<>();
	}

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

/**
 * https://abc061.contest.atcoder.jp/tasks/abc061_b
 */
public class Main {

	public static void main(String[] args) {
		
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int M = sc.nextInt();
		Node[] nodes = new Node[N];
		for(int i=0; i<N; i++) nodes[i] = new Node();
		for(int i=0; i<M; i++){
			Node a = nodes[sc.nextInt()-1];
			Node b = nodes[sc.nextInt()-1];
			a.neighbor.add(b);
			b.neighbor.add(a);
		}
		sc.close();
		
		for(Node n:nodes){
			System.out.println(n.neighbor.size());
		}

	}
	
	static class Node{
		List<Node> neighbor = new ArrayList<>();
	}

}
