#include<bits/stdc++.h>
//#include<ext/pb_ds/tree_policy.hpp>
//#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
typedef long long LL;
typedef pair<int, int> pii;
//typedef tree<pii, null, less<pii>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
#define fi first
#define se second
#define pb push_back
#define all(x) ((x).begin()), ((x).end())
const int N = 1000011;
int a[N], b[N];
int x[N], y[N], nxt[N];

bool check(int p, int x[N], int i) {
	bool res = (a[p] == 0 || x[i] >= x[i - a[p]]) && (b[p] == 0 || x[i] <= x[i - b[p]]);
	//printf("%d %d %d\n", p, i, res);
	return res;
}
int main() {
	int n, m;
	scanf("%d%d", &n, &m);
	for(int i = 1; i <= n; i++) {
		scanf("%d", &x[i]);
	}
	for(int j = 1; j <= m; j++) {
		scanf("%d", &y[j]);
	}

	set<pair<int, int> > st;
	for(int i = 1; i <= n; i++) {
		pii tmp{x[i], i};
		auto itr = st.lower_bound(tmp);
		if(itr != st.end()) {
			b[i] = i - itr->se;
		}else {
			b[i] = 0;
		}
		if(itr != st.begin()) {
			itr--;
			a[i] = i - itr->se;
		}else {
			a[i] = 0;
		}
		st.insert(tmp);
		//printf("%d %d %d\n", i, a[i], b[i]);
	}
	nxt[0] = -1;
	for(int i = 1; i <= n; i++) {
		int p = nxt[i - 1];
		while(p != -1 && !check(p + 1, x, i)) {
			p = nxt[p];
		}
		nxt[i] = p + 1;
		//printf("nxt[%d] = %d\n", i, nxt[i]);
	}
	int p = 0;
	vector<int> ans;
	for(int i = 1; i <= m; i++) {
		while(p != -1 && !check(p + 1, y, i)) {
			p = nxt[p];
		}
		p += 1;
		if(p == n) {
			ans.push_back(i - n + 1);
			p = nxt[p];
		}else {
			
		}
	}
	if(ans.empty()) {
		printf("0\n");
		exit(0);
	}
	for(int i = 0; i < (int)ans.size(); i++) {
		printf("%d%c", ans[i], i == (int)ans.size() - 1 ? '\n' : ' ');
	}
}