output_description: Print the answer in N lines. In the i-th line (1≤i≤N), print the number of
  roads connected to city i.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N M
      a_1 b_1
      :  
      a_M b_M
attempt: N, M = map(int, input().split())
  ab = []
  for _ in range(M):
    ab.append(map(int, input().split())
             
  bs = [0] * N
              
  
  for c in range(N):
    for i in range(M):
      if c+1==ab[i][0] or c+1==ab[i][1]:
        bs[c] += 1
              
  
  for _ in range(N):
    print(bs[_] ) 
problem_description: Statement
  
  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?
samples: [{"input": "4 3\n    1 2\n    2 3\n    1 4", "output": "2\n    2\n    1\n    1\n    \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.\n\n* * *"}, {"input": "2 5\n    1 2\n    2 1\n    1 2\n    2 1\n    1 2", "output": "5\n    5\n    \n\n* * *"}, {"input": "8 8\n    1 2\n    3 4\n    1 5\n    2 8\n    3 7\n    5 2\n    4 1\n    6 8", "output": "3\n    3\n    2\n    2\n    2\n    1\n    1\n    2"}]