震惊！某不知名纸张不会做入门题！

#include<bits/stdc++.h>
#define lowbit(x) x&(-x)
using namespace std;
int n,k,s;
int ans[500005],sum,xiaoyu[500005],xiaoyudengyu[500005];
int a[500005],b[500005];
int tree[500005];
int nxt[500050];
inline void add(int x,int k){
	while(x<=30){
		tree[x]+=k;
		x+=lowbit(x);
	}
}
inline int query(int x){
	int sum=0;
	while(x){
		sum+=tree[x];
		x-=lowbit(x);
	}
	return sum;
}
int main(){
	cin>>n>>k>>s;
	for(int i=1;i<=n;i++){
		cin>>a[i];
	}
	for(int i=1;i<=k;i++){
		cin>>b[i];
		xiaoyu[i]=query(b[i]-1);
		xiaoyudengyu[i]=query(b[i]);
		add(b[i],1);
	}
	xiaoyudengyu[k+1]=xiaoyu[k+1]=-1;
	memset(tree,0,sizeof(tree));
	for(int i=2,j=0;i<=k;i++){
		while((query(b[i]-1)!=xiaoyu[j+1]||query(b[i])!=xiaoyudengyu[j+1])&&j){
			for(int k=i-j;k<=i-nxt[j]-1;k++){
				add(b[k],-1);
			}
			j=nxt[j];
		}
		if(query(b[i]-1)==xiaoyu[j+1]&&query(b[i])==xiaoyudengyu[j+1]){
			j++;
		}
		nxt[i]=j;
		add(b[i],1);
	}
	memset(tree,0,sizeof(tree));
	for(int i=1,j=0;i<=n;i++){
		while((query(a[i]-1)!=xiaoyu[j+1]||query(a[i])!=xiaoyudengyu[j+1])&&j){
			for(int k=i-j;k<=i-nxt[j]-1;k++){
				add(a[k],-1);
			}
			j=nxt[j];
		}
		if(query(a[i]-1)==xiaoyu[j+1]&&query(a[i])==xiaoyudengyu[j+1]){
			j++;
		}
		if(j==k){
			ans[++sum]=i-k+1;
		}
		add(a[i],1);
	}
	cout<<sum<<endl;
	for(int i=1;i<=sum;i++){
		cout<<ans[i]<<endl;
	}
	return 0;
}