#include <vector> 
#include <list> 
#include <map> 
#include <set> 
#include <deque> 
#include <queue> 
#include <stack> 
#include <bitset> 
#include <algorithm> 
#include <functional> 
#include <numeric> 
#include <utility> 
#include <sstream> 
#include <iostream> 
#include <iomanip> 
#include <cstdio> 
#include <cmath> 
#include <cstdlib> 
#include <cctype> 
#include <string> 
#include <cstring> 
#include <ctime> 

using namespace std;

#define _int64 long long

int a[100000];

int main()
{
  int i,j,k,nb,cnt,left,right,mid,x,n,q;
  vector<pair<int,int> > a1;
  vector<pair<int,int> > ans;
  while (scanf("%d%d",&n,&q)!=EOF)
  {
    a1.clear();
    for (i=0;i<n;i++)
    {
      scanf("%d",&a[i]);
      a1.push_back(make_pair(a[i],i));
    }
    sort(a1.begin(),a1.end());
    ans.clear();
    nb=1;
    for (i=0;i<a1.size();i++)
    {
      cnt=0;
      if ((a1[i].second>0)&&(a[a1[i].second-1]!=-1)) cnt++;
      if ((a1[i].second+1<n)&&(a[a1[i].second+1]!=-1)) cnt++;
      if (cnt==2) nb++;
      if (cnt==0) nb--;
      a[a1[i].second]=-1;
      if ((i+1==a1.size())||(a1[i+1].first!=a1[i].first))
        ans.push_back(make_pair(a1[i].first,nb));
    }
    for (i=0;i<q;i++)
    {
      scanf("%d",&x);
      left=-1;right=ans.size();
      while (right-left>1)
      {
        mid=(left+right)/2;
        if (ans[mid].first<=x) left=mid;
        else right=mid;
      }
      if (left==-1) printf("1\n");
      else printf("%d\n",ans[left].second);
    }
  }
}