binary_search.cpp

// Author : Shankar Balajee Sambasivam
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
#include <bits/stdc++.h>  
#include <chrono>
#include <random>
#include <iomanip>
#include <fstream>
 
using namespace std;
 
typedef long long ll;
typedef long double ld;
typedef pair<int,int> p32;
typedef pair<ll,ll> p64;
typedef pair<double,double> pdd;
typedef vector<ll> v64;
typedef vector<int> v32;
typedef vector<vector<int> > vv32;
typedef vector<vector<ll> > vv64;
typedef vector<vector<p64> > vvp64;
typedef vector<p64> vp64;
typedef vector<p32> vp32;
ll MOD = 998244353;
double eps = 1e-12;
#define forn(i,e) for(ll i = 0; i < e; i++)
#define forsn(i,s,e) for(ll i = s; i < e; i++)
#define rforn(i,s) for(ll i = s; i >= 0; i--)
#define rforsn(i,s,e) for(ll i = s; i >= e; i--)
#define endl "\n"
#define dbg(x) cout<<#x<<" = "<<x<<ln
#define mp make_pair
#define pb push_back
#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((ll)(x).size())
#define int long long
 

/* CODE BEGINS HERE */




int32_t main()
{
    int n,k;
    cin >>n>>k;
    int a[n];
    forn(i,n)
    {
        cin >>a[i];
    }
    while(k--)
    {
        int x;
        cin >>x;
        if(x<a[0])
        {
            cout << 0 << endl;
            continue;
        }
        int beg=0;
        int end=n-1;
        int mid;
        while(beg<end)
        {
            mid=(beg)+(end-beg)/2;
            if(a[mid]>x)
            {
                end=mid-1;
            }
            else if(a[mid]<=x)
            {
                beg=mid;
            }
        }
        cout << mid<< endl;
    }
}