Problems
Binary search - 1
Binary search - 1
Sorted array of n integers is given. You must answer q queries: how many times the given number x appears in the array.
Input data
First line contains two integers n and q~(n, q \le 10^6). Second line contains n integers sorted in increasing order. Each of the next q lines contains value of x. The numbers in array do not exceed 10^9 by absolute value.
Output data
For each value of x print on a separate line the number of times it appears in array.
Examples
Input example #1
6 3 2 4 4 8 11 14 10 4 2
Output example #1
0 2 1
Input example #3
10 5 0 0 1 1 2 3 4 5 6 8 8 2 0 12 10
Output example #3
1 1 2 0 0