#pragma comment(linker, "/STACK:10240000,10240000")

 #include <iostream>

 #include <cstdio>

 #include <algorithm>

 #include <cstdlib>

 #include <cstring>

 #include <map>

 #include <queue>

 #include <deque>

 #include <cmath>

 #include <vector>

 #include <ctime>

 #include <cctype>

 #include <set>

 using namespace std;

 #define mem0(a) memset(a, 0, sizeof(a))

 #define lson l, m, rt << 1

 #define rson m + 1, r, rt << 1 | 1

 #define define_m int m = (l + r) >> 1

 #define rep(a, b) for(int a = 0; a < b; a++)

 #define all(a) (a).begin(), (a).end()

 #define lowbit(x) ((x) & (-(x)))

 #define constructInt4(name, a, b, c, d) name(int a = 0, int b = 0, int c = 0, int d = 0): a(a), b(b), c(c), d(d) {}

 #define constructInt3(name, a, b, c) name(int a = 0, int b = 0, int c = 0): a(a), b(b), c(c) {}

 #define constructInt2(name, a, b) name(int a = 0, int b = 0): a(a), b(b) {}

 #define pc(a) putchar(a)

 #define ps(a) puts(a)

 typedef double db;

 typedef long long LL;

 typedef pair<int, int> pii;

 typedef multiset<int> msi;

 typedef multiset<int>::iterator msii;

 typedef set<int> si;

 typedef set<int>::iterator sii;

 typedef vector<int> vi;

 const int dx[] = {, , -, , , , -, -};

 const int dy[] = {, -, , , -, , , -};

 const int maxn = 1e6 + ;

 const int maxm = 1e5 + ;

 const int maxv = 1e7 + ;

 const int max_val = 1e6 + ;

 const int MD = 1e9 +;

 const int INF = 1e9 + ;

 const double PI = acos(-1.0);

 const double eps = 1e-;

 inline int ReadInt() {

     char c = getchar();

     while(!isdigit(c)) c = getchar();

     int x = ;

     while(isdigit(c)) {

         x = x *  + c - '';

         c = getchar();

     }

     return x;

 }

 inline void WriteInt(int i) {

     int p = ;

     static int buf[];

     if(i == ) buf[p++] = ;

     else while(i) {

         buf[p++] = i % ;

         i /= ;

     }

     for(int j = p - ; j >= ; j--) putchar('' + buf[j]);

 }

 bool cmp(const pii &a, const pii &b) {

     return a.first > b.first;

 }

 int main() {

     //freopen("in.txt", "r", stdin);

     int n, q;

     while (cin >> n >> q) {

         vector<pii> a(n), b(q);

         vector<int> out(q);

         rep(i, n) {

             a[i].first = ReadInt();

             a[i].second = i;

         }

         rep(i, q) {

             b[i].first = ReadInt();

             b[i].second = i;

         }

         sort(all(a), cmp);

         sort(all(b), cmp);

         vector<bool> vis(n);

         int now = , ans = ;

         rep(i, q) {

             while (now < n && a[now].first > b[i].first) {

                 int pos = a[now].second;

                 vis[pos] = true;

                 ans++;

                 if (pos && vis[pos - ]) ans--;

                 if (pos < n -  && vis[pos + ]) ans--;

                 now++;

             }

             out[b[i].second] = ans;

         }

         rep(i, q) {

             WriteInt(out[i]);

             pc('\n');

         }

     }

     return ;

 }