// UUID: 7f05ca3d-bc92-4575-b5f7-5dbf7829bbca
#include <bits/stdc++.h>
using namespace std;

int main() {
	int n, q;
	cin >> n >> q;
	vector<int> sor(n), lis(n, INT_MAX), eloz(n, -1), st, lis_in_pos(n, -1);

	cout << 1 << endl;

	for (int i = 0; i < n; i++){
		cin >> sor[i];
		while(!st.empty() && sor[st.back()] < sor[i]) st.pop_back();
		if (!st.empty()) eloz[i] = st.back();
		st.push_back(i);
	}

	cout << 1 << endl;

	for (int i = n - 1; i >= 0; i--){
		if (lis_in_pos[i] == -1) lis_in_pos[i] = 0;
		if (eloz[i] != -1) lis_in_pos[eloz[i]] = lis_in_pos[i] + 1;
		lis[lis_in_pos[i]] = min(lis[lis_in_pos[i]], sor[i]);
	}
	for (int x : lis) cout << x << " ";
	cout << endl;

	for (int i = 0; i < q; i++){
		int a;
		cin >> a;
		cout << lower_bound(lis.begin(), lis.end(), a) - lis.begin() + 1 << " ";
	}

}