#include<iostream>
#include<utility>
#include<vector>
#include<algorithm>
constexpr const int p = 1e9 + 7, B = 1e8 + 7;
constexpr int plus(int x, int y) { return x += y, x >= p ? x - p : x; }
constexpr int mul(int x, int y) { return 1ll * x * y % p; }
constexpr int pow(int x, int y) {
	int ret = 1;
	while (y) {
		if (y & 1) ret = mul(ret, x);
		x = mul(x, x), y >>= 1;
	}
	return ret;
}
constexpr const int binv = pow(B, p - 2);
struct Data { int I, c, A, B; };
bool operator == (const Data &x, const Data &y) {
	return x.I == y.I && x.c == y.c && x.A == y.A && x.B == y.B;
}
bool operator != (const Data &x, const Data &y) {
	return !(x == y);
}
int pb[2000006];
Data operator + (const Data &x, const Data &y) {
//	std::cerr << x.I << " " << x.c << " " << y.I << " => " << plus(x.I, mul(pb[x.c], y.I)) << std::endl;
	return {plus(y.I, mul(pb[y.c], x.I)), x.c + y.c, plus(y.A, mul(pb[y.c], x.A)), plus(y.B, mul(pb[y.c], plus(x.B, mul(y.c, x.I))))};
}
Data pop_front(const Data &x) {
	return {plus(x.I, p - pb[x.c - 1]), x.c - 1, x.A, x.B};
}
Data push_back(const Data &x, int a) {
	return {plus(mul(x.I, B), 1), x.c + 1, plus(mul(x.A, B), a), x.B};
}
Data offset(const Data &x, int a) {
	return {x.I, x.c, plus(x.A, mul(a, x.I)), x.B};
}
namespace S1 {
	int ls[5000006], rs[5000006], tot;
	Data A[5000006];
	void pull(int u) { A[u] = A[ls[u]] + A[rs[u]]; }
	int clone(int u) {
		tot++, A[tot] = A[u], ls[tot] = ls[u], rs[tot] = rs[u];
		return tot;
	}
	void insert(int &u, int l, int r, int k, int d) {
		u = clone(u);
		if (l == r) return A[u] = push_back(A[u], d), void();
		int mid = (l + r) >> 1;
		if (k <= mid) insert(ls[u], l, mid, k, d);
		if (mid < k) insert(rs[u], mid + 1, r, k, d);
		return pull(u);
	}
}
int m, n, a[100005], root[100005], b[1000006], v;
std::vector<int> V;
namespace S2 {
	Data A[5000006]; int tag[5000006];
	void offset(int u, int a) { tag[u] += a, A[u] = offset(A[u], p + a); }
	void push(int u) {
		if (!tag[u]) return;
		offset(u << 1, tag[u]), offset(u << 1 | 1, tag[u]), tag[u] = 0;
	}
	void pull(int u) { A[u] = A[u << 1] + A[u << 1 | 1]; }
	void insert(int u, int l, int r, int k, int d) {
		if (l == r) return A[u] = push_back(A[u], d), void();
		int mid = (l + r) >> 1; push(u);
		if (k <= mid) insert(u << 1, l, mid, k, d);
		else insert(u << 1 | 1, mid + 1, r, k, d);
		return pull(u);
	}
	void erase(int u, int l, int r, int k) {
		if (l == r) return A[u] = pop_front(A[u]), void();
		int mid = (l + r) >> 1; push(u);
		if (k <= mid) erase(u << 1, l, mid, k);
		else erase(u << 1 | 1, mid + 1, r, k);
		return pull(u);
	}
	void pop_front(int k) { offset(1, -1), erase(1, 1, v, k); }
}
int fail[100005];
int main() {
	std::ios::sync_with_stdio(0), std::cin.tie(0), std::cout.tie(0);
	std::cin >> m >> n;
	pb[0] = 1;
	for (int i = 1; i <= n; i++) pb[i] = mul(pb[i - 1], B);
	for (int i = 1; i <= m; i++) std::cin >> a[i], V.push_back(a[i]);
	for (int i = 1; i <= n; i++) std::cin >> b[i], V.push_back(b[i]);
	std::sort(V.begin(), V.end()), V.resize(v = std::unique(V.begin(), V.end()) - V.begin());
	for (int i = 1; i <= m; i++) a[i] = std::lower_bound(V.begin(), V.end(), a[i]) - V.begin() + 1;
	for (int i = 1; i <= n; i++) b[i] = std::lower_bound(V.begin(), V.end(), b[i]) - V.begin() + 1;
	for (int i = 1; i <= m; i++) {
		root[i] = root[i - 1];
		S1::insert(root[i], 1, v, a[i], i);
	}
	int p = 1; fail[1] = fail[2] = 1, S2::insert(1, 1, v, a[2], 1);
	for (int i = 3, j = 1; i <= m; i++) {
		S2::insert(1, 1, v, a[i], i - p);
		while (j != 1 && S1::A[root[j + 1]] != S2::A[1]) {
			for (int d = 0; d < j - fail[j]; d++) S2::pop_front(a[++p]);
			j = fail[j];
		}
		if (S1::A[root[j + 1]] == S2::A[1]) j++;
		else while (p != i - 1) S2::pop_front(a[++p]);
		fail[i] = j;
	}
	while (p != m) S2::pop_front(a[++p]);
	p = 0; int ans = 0; S2::insert(1, 1, v, b[1], 1);
	for (int i = 2, j = 1; i <= n; i++) {
		S2::insert(1, 1, v, b[i], i - p);
		while (j != 1 && S1::A[root[j + 1]] != S2::A[1]) {
			for (int d = 0; d < j - fail[j]; d++) S2::pop_front(b[++p]);
			j = fail[j];
		}
		if (S1::A[root[j + 1]] == S2::A[1]) {
			j++;
			if (j == m) {
				std::cout << i - m + 1 << " ", ans++;
				for (int d = 0; d < j - fail[j]; d++) S2::pop_front(b[++p]);
				j = fail[j];
			}
		} else while (p != i - 1) S2::pop_front(b[++p]);
	}
	if (!ans) std::cout << 0 << '\n';
}