{"problem":{"name":"Counting Roads","description":{"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 c","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc061_b"},"statements":[{"statement_type":"Markdown","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?\n\n## Constraints\n\n*   $2≤N,M≤50$\n*   $1≤a_i,b_i≤N$\n*   $a_i ≠ b_i$\n*   All input values are integers.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$ $M$\n$a_1$ $b_1$\n$:$  \n$a_M$ $b_M$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc061_b","tags":[],"sample_group":[["4 3\n1 2\n2 3\n1 4","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."],["2 5\n1 2\n2 1\n1 2\n2 1\n1 2","5\n5"],["8 8\n1 2\n3 4\n1 5\n2 8\n3 7\n5 2\n4 1\n6 8","3\n3\n2\n2\n2\n1\n1\n2"]],"created_at":"2026-03-03 11:01:14"}}