递归二分，64求调

#include<bits/stdc++.h>
#define maxn 1000000+5
#define ll long long
using namespace std;
ll a[maxn];
ll bisearch(ll a[],ll left,ll right,ll x){
    if(left>right){
        return -1;
    }
    ll mid=(left+right)/2;
    if(a[mid]==x){
        while(a[mid]==x)mid--;
        return mid+1;
    }
    else if(a[mid]<x) return bisearch(a,mid+1,right,x);
    else if(a[mid]>x) return bisearch(a,left,mid-1,x);
}

void solve(){
    ll n;
    int m;
    scanf("%lld%d",&n,&m);
    for(ll i=1;i<=n;i++){
        scanf("%lld",&a[i]);
    }
    for(int i=1;i<=m;i++){
        ll x;
        scanf("%lld",&x);
        ll y=bisearch(a,1,n,x);
        printf("%lld ",y);
    }
}
int main(){
    solve();
}