#include <bits/stdc++.h>
using namespace std;

int n, m;
vector<int> vec;

int main() {
    scanf("%d %d", &n, &m);
    for(int i = 0, val; i < n; ++i) {
        scanf("%d", &val);
        vec.emplace_back(val);
    }
    sort(vec.begin(), vec.end());
    for(int i = 0; i < vec.size(); ++i) vec[i] -= i;
    for(int i = 0, val; i < m; ++i) {
        scanf("%d", &val);
        int p = upper_bound(vec.begin(), vec.end(), val) - vec.begin();
        printf("%d ", val + p);
    }
    printf("\n");
}