{"raw_statement":[{"iden":"problem statement","content":"There are $N$ cities and $M$ roads. The $i$\\-th road $(1≤i≤M)$ connects two cities $a_i$ and $b_i$ $(1≤a_i,b_i≤N)$ bidirectionally. There may be more than one road that connects the same pair of two cities. For each city, how many roads are connected to the city?"},{"iden":"constraints","content":"*   $2≤N,M≤50$\n*   $1≤a_i,b_i≤N$\n*   $a_i ≠ b_i$\n*   All input values are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$N$ $M$\n$a_1$ $b_1$\n$:$  \n$a_M$ $b_M$"},{"iden":"sample input 1","content":"4 3\n1 2\n2 3\n1 4"},{"iden":"sample output 1","content":"2\n2\n1\n1\n\n*   City $1$ is connected to the $1$\\-st and $3$\\-rd roads.\n*   City $2$ is connected to the $1$\\-st and $2$\\-nd roads.\n*   City $3$ is connected to the $2$\\-nd road.\n*   City $4$ is connected to the $3$\\-rd road."},{"iden":"sample input 2","content":"2 5\n1 2\n2 1\n1 2\n2 1\n1 2"},{"iden":"sample output 2","content":"5\n5"},{"iden":"sample input 3","content":"8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8"},{"iden":"sample output 3","content":"3\n3\n2\n2\n2\n1\n1\n2"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}