

GunnerTime Limit: 8000/4000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3093 Accepted Submission(s): 1367 Problem Description Long long ago, there is a gunner whose name is Jack. He likes to go hunting very much. One day he go to the grove. There are $n$ birds and $n$ trees. The $ith$ bird stands on the top of the $ith$ tree. The trees stand in straight line from left to the right. Every tree has its height. Jack stands on the left side of the left most tree. When Jack shots a bullet in height H to the right, the bird which stands in the tree with height $H$ will falls. Jack will shot many times, he wants to know how many birds fall during each shot. a bullet can hit many birds, as long as they stand on the top of the tree with height of $H$. Input There are multiple test cases (about 5), every case gives $n,m$ in the first line, $n$ indicates there are $n$ trees and $n$ birds, $m$ means Jack will shot $m$ times. In the second line, there are $n$ numbers $h[1],h[2],h[3],¡,h[n]$ which describes the height of the trees. In the third line, there are m numbers $q[1],q[2],q[3],¡,q[m]$ which describes the height of the Jack¡¯s shots. Please process to the end of file. [Technical Specification] $1 \leq n,m \leq 1000000(10^{6})$ $1 \leq h[i],q[i] \leq 1000000000(10^{9})$ All inputs are integers. Output For each $q[i]$, output an integer in a single line indicates the number of birds Jack shot down. Sample Input
Sample Output
Hint Huge input, fast IO is recommended. Source  
