#include <bits/stdc++.h>
using namespace std;
#define pii pair <int, int>
#define fi first
#define se second
#define mp make_pair
#define isz(a) (int)(a).size()
const int NM = 1e6, MOD = 2e9+11;
int n, m, p[NM+5], h[NM+5], pw[NM+5];
vector <int> arr, ans;
pii st[4*NM+5];
void update(int id, int l, int r, int i, int val){
if (i < l || i > r) return;
if (l == r){
st[id].fi = val > 0;
st[id].se = val;
return;
}
int mid = (l+r)/2;
update(2*id, l, mid, i, val);
update(2*id+1, mid+1, r, i, val);
st[id] = mp(st[2*id].fi+st[2*id+1].fi, (1LL*st[2*id].se*pw[st[2*id+1].fi]+st[2*id+1].se)%MOD);
}
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
cin >> n >> m;
cin.ignore(255, '\n');
string S;
getline(cin, S);
int j = 0;
for (int i = 1; i <= n; i++){
while (j < isz(S) && S[j] != ' '){
p[i] = p[i]*10+S[j]-'0';
j++;
}
p[i]--;
j++;
}
getline(cin, S);
j = 0;
for (int i = 1; i <= m; i++){
while (j < isz(S) && S[j] != ' '){
h[i] = h[i]*10+S[j]-'0';
j++;
}
arr.push_back(h[i]);
j++;
}
sort(arr.begin(), arr.end());
for (int i = 1; i <= m; i++) h[i] = lower_bound(arr.begin(), arr.end(), h[i])-arr.begin()+1;
pw[0] = 1;
for (int i = 1; i <= n; i++)
pw[i] = 1LL*pw[i-1]*n%MOD;
int target_res = 0, tmp = 0;
for (int i = 1; i <= n; i++){
target_res = (1LL*target_res*n+p[i])%MOD;
tmp = (1LL*tmp*n+1)%MOD;
}
for (int i = 1; i <= n; i++) update(1, 1, m, h[i], i);
if ((0LL+st[1].se-tmp+MOD)%MOD == target_res) ans.push_back(1);
for (int i = 2; i+n-1 <= m; i++){
update(1, 1, m, h[i-1], 0);
update(1, 1, m, h[i+n-1], i+n-1);
if (((st[1].se-1LL*i*tmp)%MOD+MOD)%MOD == target_res) ans.push_back(i);
}
cout << isz(ans) << '\n';
for (int x : ans) cout << x << ' ';
return 0;
}
