1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <algorithm>
 5 using namespace std;
 6 #define M 500005
 7 
 8 struct point{
 9     int i, v;
10 }p[M];
11 struct node
12 {
13     int v;
14     int cur;
15 }s[M];
16 int has[M],  res[M];
17 
18 bool cmp (point a, point b)
19 {
20     return a.v > b.v;
21 }
22 int S()
23 {
24     int ret=0,ok=0;
25     char c;
26     while((c=getchar()))
27     {
28         if(c>=‘0‘&&c<=‘9‘)
29         ret=(ret<<3)+ret+ret+c-‘0‘,ok=1;
30         else if(ok)
31         return ret;
32     }
33     return ret;
34 }
35 bool cmp2(node a,node b)
36 {
37     return a.v<b.v;
38 }
39 int main()
40 {
41     int  n, d, i, j, ans;
42     while (~scanf("%d%d",&n,&d))
43     {
44         for (i = 0; i < n; i++)
45         {
46             p[i].v=S();
47             p[i].i = i+1;
48         }
49         sort(p, p+n, cmp);
50         for (j = 0; j < d; j++)
51         {
52             s[j].v=S();
53             s[j].cur=j;
54         }
55         sort(s,s+d,cmp2);
56         memset(has, 0, sizeof(has));
57         ans = 0;
58         for (i = 0, j = d - 1; j >= 0; j--)
59         {
60             for ( ; i < n; i++) 
61             {
62                 if (p[i].v <= s[j].v)
63                     break;
64                 int id = p[i].i;
65                 has[id] = 1;
66                 if (!has[id-1] && !has[id+1]) ++ans;
67                 else if (has[id-1] && has[id+1]) --ans;
68             }
69             res[s[j].cur] = ans;
70         }
71         for (i = 0; i < d; i++)
72         {
73             printf ("%d\n", res[i]);
74         }
75     }
76     return 0;
77 }