#include <bits/stdc++.h>
using namespace std;
const int BASE = (int)1e6 + 3;
const int MOD = 1e9 + 7;
const int N = 1e6 + 5;
int n, m;
int a[N];
int b[N];
int p[N];
int sp[N];
void sub(int& a, int b) {
a -= b;
if (a < 0) {
a += MOD;
}
}
struct SegTree {
struct Node {
int len;
int value;
Node(int l = 0, int a = 0) {
len = l;
value = a;
}
Node operator+(const Node& rhs) const {
return Node(len + rhs.len, (1ll * value * p[rhs.len] % MOD + rhs.value) % MOD);
}
};
SegTree *lf, *rt;
int l, r;
Node val;
int lazy;
SegTree(int lo = 1, int hi = 0) {
lf = rt = NULL;
l = lo, r = hi;
val = Node(0, 0);
lazy = 0;
}
void expand() {
if (l == r) {
return;
}
int mid = (l + r) >> 1;
if (lf == NULL) {
lf = new SegTree(l, mid);
}
if (rt == NULL) {
rt = new SegTree(mid + 1, r);
}
}
void push_lazy() {
if (l == r) {
return;
}
expand();
lf->lazy += lazy;
if (lf->val.len)
sub(lf->val.value, 1ll * sp[lf->val.len - 1] * lazy % MOD);
rt->lazy += lazy;
if (rt->val.len)
sub(rt->val.value, 1ll * sp[rt->val.len - 1] * lazy % MOD);
lazy = 0;
}
void add(int i, int v) {
if (i < l || r < i) {
return;
}
if (l == r) {
val = Node(1, v);
return;
}
push_lazy();
lf->add(i, v);
rt->add(i, v);
val = lf->val + rt->val;
}
void del(int i) {
if (i < l || r < i) {
return;
}
if (l == r) {
val = Node(0, 0);
return;
}
push_lazy();
lf->del(i);
rt->del(i);
val = lf->val + rt->val;
}
void dec(int u, int v) {
if (v < l || r < u) {
return;
}
if (u <= l && r <= v) {
lazy++;
if (val.len)
sub(val.value, sp[val.len - 1]);
return;
}
push_lazy();
lf->dec(u, v);
rt->dec(u, v);
val = lf->val + rt->val;
}
Node get(int u, int v) {
if (v < l || r < u) {
return Node();
}
if (u <= l && r <= v) {
return val;
}
push_lazy();
return lf->get(u, v) + rt->get(u, v);
}
};
template <class T>
struct Compressor {
#define all(x) (x).begin(), (x).end()
vector<T> val;
void add(T x) {
val.push_back(x);
}
void init() {
sort(all(val));
val.resize(unique(all(val)) - val.begin());
}
Compressor(vector<T> v) {
val = v;
init();
}
Compressor(T* a, int n, int one = 1) {
val = vector<T>(a + one, a + n + one);
init();
}
int idx(T x) {
return lower_bound(all(val), x) - val.begin() + 1;
}
#undef all
};
int main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
#define task "a"
if (fopen(task ".inp", "r")) {
freopen(task ".inp", "r", stdin);
freopen(task ".out", "w", stdout);
}
cin >> n >> m;
for (int i = 1; i <= n; i++) {
cin >> a[i];
}
for (int i = 1; i <= m; i++) {
cin >> b[i];
}
int h = 0;
p[0] = 1;
sp[0] = 1;
for (int i = 1; i <= m; i++) {
p[i] = 1ll * p[i - 1] * BASE % MOD;
sp[i] = (sp[i - 1] + p[i]) % MOD;
}
for (int i = 1; i <= n; i++) {
h = (1ll * h * BASE % MOD + a[i]) % MOD;
}
Compressor<int> cps(b, m);
SegTree* root = new SegTree(1, m);
for (int i = 1; i <= n; i++) {
b[i] = cps.idx(b[i]);
root->add(b[i], i);
}
vector<int> ans;
if (root->val.value == h) {
ans.push_back(1);
}
for (int i = n + 1; i <= m; i++) {
b[i] = cps.idx(b[i]);
root->del(b[i - n]);
root->dec(1, m);
root->add(b[i], n);
if (root->val.value == h) {
ans.push_back(i - n + 1);
}
}
cout << ans.size() << "\n";
for (int i : ans) {
cout << i << " ";
}
return 0;
}
/**
* b[] = [b_1, b_2, ..., b_n]
* id[] = [1, 2, ..., n]
* sorted(id) == a --> is a starting point
*/
