#include <bits/stdc++.h>
using namespace std;
 
    vector<int> countEleLessThanOrEqual(int arr1[], int arr2[], 
                                 int m, int n)
    {
    vector<int>res;
    sort(arr2, arr2+n);
    for(int i = 0; i<m; i++) res.push_back(upper_bound(arr2,arr2+n,arr1[i])-arr2);
    return res;
    }
 
int main() {
int m = 6, n = 6;
int arr1[] = {1,2,3,4,7,9};
int arr2[] = {0,1,2,1,1,4};
	vector<int>res = countEleLessThanOrEqual(arr1, arr2, m, n);
for(auto it : res) cout<<it<<" ";
cout<<endl;
	return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgogICAgdmVjdG9yPGludD4gY291bnRFbGVMZXNzVGhhbk9yRXF1YWwoaW50IGFycjFbXSwgaW50IGFycjJbXSwgCiAgICAgICAgICAgICAgICAgICAgICAgICAgICAgICAgIGludCBtLCBpbnQgbikKICAgIHsKICAgIHZlY3RvcjxpbnQ+cmVzOwogICAgc29ydChhcnIyLCBhcnIyK24pOwogICAgZm9yKGludCBpID0gMDsgaTxtOyBpKyspIHJlcy5wdXNoX2JhY2sodXBwZXJfYm91bmQoYXJyMixhcnIyK24sYXJyMVtpXSktYXJyMik7CiAgICByZXR1cm4gcmVzOwogICAgfQogCmludCBtYWluKCkgewppbnQgbSA9IDYsIG4gPSA2OwppbnQgYXJyMVtdID0gezEsMiwzLDQsNyw5fTsKaW50IGFycjJbXSA9IHswLDEsMiwxLDEsNH07Cgl2ZWN0b3I8aW50PnJlcyA9IGNvdW50RWxlTGVzc1RoYW5PckVxdWFsKGFycjEsIGFycjIsIG0sIG4pOwpmb3IoYXV0byBpdCA6IHJlcykgY291dDw8aXQ8PCIgIjsKY291dDw8ZW5kbDsKCXJldHVybiAwOwp9