A. Ordering Cupcakes
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Alice is hosting a cupcake party to celebrate cupcake day but isn't sure what to order. To make things easier, Alice gives each of her $$$N$$$ guests a list $$$M$$$ of cupcake flavors and asks them to pick their favorite one. Each flavor can be represented by integer $$$f_i \ (1 \leq f_i \leq M)$$$

As she started ordering, Alice realized that her local bakery only sells cupcakes in dozens. She needs you to help her determine how many dozen of each cupcake to buy so that she minimizes the number of cupcakes she buys while ensuring that everyone can eat at least one cupcake of their favorite flavor.

Input

The first line of input will contain two space-separated integers, $$$N\ (1 \leq N \leq 10000)$$$, the number of guests she plans to invite, and $$$M\ (1 \leq M \leq 100)$$$, the number of flavors the bakery sells.

The second line of input contains $$$N$$$ space-separated integers $$$f_i\ (1 \leq f_i \leq M)$$$, where $$$f_i$$$ represents the $$$i$$$th guest's favorite flavor.

Output

Output $$$M$$$ lines of output, where the $$$i$$$th line consists of a single integer representing how many dozen of flavor $$$i$$$ Alice should buy for her party.

Examples
Input
3 2
1 2 1
Output
1
1
Input
14 2
1 1 1 1 1 1 1 1 1 1 1 1 1 2
Output
2
1
Note

In the second test case, 13 guests want flavor 1. We have to order 2 dozen of flavor 1 because if we only ordered one dozen (12), we would be one cupcake short.