// I AM A MUSLIM
#include "bits/stdc++.h"
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#define fast_io std::ios::sync_with_stdio(0);std::cin.tie(0)
#define lli long long int
#define flush fflush(stdout)
#define new_line printf("\n")
#define yn(a, b) printf("%s\n", a >= b ? "Yes":"No")
#define safe_mod(a, M) ((a%M+M)%M)
// #define int lli
using pii = std::pair<int,int>;
const int MOD = 1000000007;
const int mxN = 100100;
signed main() {
int testCases=1;
// scanf("%d",&testCases);
for (int TC = 1; TC <= testCases; TC++) {
int n, m;
scanf("%d%d",&n,&m);
int ans[m]; memset(ans,-1,sizeof ans);
std::vector<pii> al;
std::vector<int> a(n); for (auto &i : a) scanf("%d",&i);
for (int i = 0, v; i < m; i++) {
scanf("%d",&v);
al.push_back(pii(v, i));
}
sort(al.begin(), al.end());
int lim = m;
for (int i = 0; i < n; i++) {
int v = a[i];
auto it = lower_bound(al.begin(), al.begin()+lim, pii(v, -1));
if (it != al.end()) {
int at = it-al.begin();
for (int j = at; j < lim; j++) ans[al[j].second] = i+1;
lim = at;
// printf("%d %d\n", i, lim);
}
}
for (int i = 0; i < m; i++) printf("%d\n", ans[i]);
// new_line;
}
return 0;
}
/*
*/