// UUID: 3c4fa843-8cfa-4f4d-a164-eea66205858b
#include <bits/stdc++.h>
using namespace std;

const int MAXN = 1e6 + 5, MAXK = 1e6 + 1, INF = 2e9;

int n, k, b[MAXN], h[MAXK], s[MAXN];
array<int, 2> vans[MAXN];

int main() {
    cin.tie(0), ios::sync_with_stdio(0);

    cin >> n >> k;
    for (int i = 0; i < n; i++) cin >> b[i];
    for (int i = 0; i < k; i++) cin >> h[i];
    b[n] = INF;

    s[0] = INF + 1;
    int sp = 0, vansp = -1;
    for (int x : b) {
        int i = 1;
        while (s[sp] <= x) {
            vans[++vansp] = {s[sp], i};
            sp--;
            i++;
        }
        s[++sp] = x;
    }

    vans[++vansp] = {0, 0};
    vans[++vansp] = {INF, 0};
    sort(vans, vans + vansp + 1);

    for (int i = 1; i <= vansp; i++) {
        vans[i][1] = max(vans[i][1], vans[i - 1][1]);
    }
    for (int i = 0; i < k; i++) {
        int l = -1, r = vansp + 1;
        while (r - l > 1) {
            int m = (l + r) / 2;
            if (vans[m][0] >= h[i]) {
                r = m;
            } else {
                l = m;
            }
        }
        cout << vans[l][1] << " ";
    }
    cout << "\n";
}