#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC optimize("conserve-stack")
#include<bits/stdc++.h>
#define int long long
#define ll long long
#define down cout<<'\n';
#define debug cout<<" cucuucucuuu",down
#define NHP ios_base::sync_with_stdio(0);cout.tie(0);cin.tie(0);
#define modwwe int t;cin>>t; while(t--)
#define bit(i,j) (i>>j&1)
#define sobit(a) __builtin_popcountll(a)
#define task "test"
#define fin(x) freopen(x".inp","r",stdin)
#define fou(x) freopen(x".ans","w",stdout)
#define pb push_back
#define mask(i) (1<<i)
#define checktime cerr << (double)clock() / CLOCKS_PER_SEC * 1000 << " ms";
using namespace std;
#define getchar_unlocked getchar
inline int scan()
{
char c = getchar_unlocked();
int x = 0;
while (c < '0' || c > '9')
{
c = getchar_unlocked();
}
while (c >= '0' && c <= '9')
{
x = (x << 1) + (x << 3) + c - '0';
c = getchar_unlocked();
}
return x;
};
void phongbeo();
const int inf = 1e18;
const int mod2 = 1e9+7;
const int mod1 = 998244353;
const int base=67;
int add(int x,int y)
{
if(x+y>=mod2) x-=mod2;
if(x+y<0) x+=mod2;
return x+y;
}
struct icd
{
long double a;
int b;
};
struct ib
{
int a;
int b;
};
struct ic
{
int a, b, c, d;
};
struct ie
{
int a, b, c, d, e;
};
int n, m, s1, s2, s4, s3, sf, k, s5, s6, mx, s7, s8, s9, mx2, res, dem2 = 0, dem = 0, s33, dem3, dem4, mid, l2, r2, center;
int i, s10, s12,k1,k2,k3,s11,limit,w,l,r,last,root,cost;
int kk,invf;
int el = 19;
main()
{
if(fopen(task".inp","r"))
{
fin(task);
fou(task);
}
NHP
/// cin>>s1;
// modwwe
phongbeo(),down
// checktime
}
int pw[1000011];
int a[1000011];
vector<int> v;
struct IT
{
ib t[5000001];
ib mer(ib a,ib b)
{
return {(a.a*pw[b.b]%mod2+b.a)%mod2,a.b+b.b};
}
void upd(int node,int l,int r,int l1,int x)
{
if(l==r)
{
t[node]= {x,1};
if(x==0)t[node].b=0;
return;
}
int mid=l+r>>1;
if(l1<=mid) upd(node<<1,l,mid,l1,x);
else upd(node<<1|1,mid+1,r,l1,x);
t[node]=mer(t[node<<1],t[node<<1|1]);
}
} st;
vector<int>ans;
void phongbeo()
{
cin>>n>>m;
for(int i=1; i<=n; i++)
cin>>l,s4=(s4*base%mod2+l)%mod2;
for(int i=1; i<=m; i++)
cin>>a[i],v.pb(a[i]);
sort(v.begin(),v.end());
for(int i=1; i<=m; i++)
a[i]=lower_bound(v.begin(),v.end(),a[i])-v.begin()+1;
pw[0]=1;
s2=1;
for(int i=1; i<=n-1; i++)
pw[i]=pw[i-1]*base%mod2,s2=add(s2,pw[i]);
for(int i=1; i<=n; i++)
st.upd(1,1,m,a[i],i);
for(int i=1; i<=m-n+1; i++)
{
if(st.t[1].a==s4)
ans.pb(i);
st.upd(1,1,m,a[i],0);
if(i!=m-n+1)
st.upd(1,1,m,a[i+n],i+n);
s4=add(s4,s2);
}
cout<<ans.size(),down
for(auto x:ans)
cout<<x<<" ";
}
