Binary search - 1

A sorted array of $n$ integers is given. You need to answer $q$ queries: how many times a given number $x$ appears in the array.

Input

The first line contains two numbers $n$ and $q(n,q\le 10^6)$. The second line contains $n$ integers sorted in increasing order. Each of the following $q$ lines contains a single value $x$. All numbers in the array do not exceed $10^9$ in absolute value.

Output

For each value of $x$, print the number of times it occurs in the array in a separate line.

Examples