#include<bits/stdc++.h>
using namespace std;

const int maxn=5e6+50;

int n,k,s,next_[maxn];
int A[maxn],B[maxn],c[maxn];
int ranq[maxn],ress[maxn];
int ans,anss[maxn]; 

int lowbit(int x){
	return x&(-x);
}

void update(int x,int y){
	while(x<=s){
		c[x]+=y;
		x+=lowbit(x);
	}
}

int query(int x){
	int ans2=0;
	while(x){
		ans2+=c[x];
		x-=lowbit(x);
	}
	return ans2;
}

inline void input(){
	scanf("%d %d %d",&n,&k,&s);
	for(int i=1;i<=n;++i){
		scanf("%d",&A[i]);
	}
	for(int i=1;i<=k;++i){
		scanf("%d",&B[i]);
		update(B[i],1);
		ranq[i]=query(B[i]);
		ress[i]=query(B[i]-1);
		//cout<<"%%%"<<i<<' '<<ranq[i]<<' '<<ress[i]<<endl;
	}
}

inline void Next(){
	for(int i=2,j=0;i<=k;++i){
		while(j && (query(B[i])!=ranq[j+1] || query(B[i]-1)!=ress[j+1])){
			j=next_[j];
		}
		++j;
		next_[i]=j;
	}
}

inline void match(){
	for(int i=1,j=0;i<=n;++i){
		update(A[i],1);
		while(j &&(query(A[i])!=ranq[j+1] || query(A[i]-1)!=ress[j+1])){
			//cout<<i<<' '<<j+1<<' '<<A[i]<<' '<<query(A[i])<<' '<<ranq[j+1]<<' '<<query(A[i]-1)<<' '<<ress[j+1]<<endl;
			for(int q=i-j;q<i-next_[j];++q){
				update(A[q],-1);
				//比对相同区间把前面的删去
			}
			//cout<<"$$$"<<j<<' '<<next_[j]<<endl;
			j=next_[j];
		}
		//cout<<"###"<<i<<' '<<j<<endl;
		j++;
		if(j==k)	anss[++ans]=i-j+1;
	}
}

int main(){
	input();
	Next();
	memset(c,0,sizeof(c));
	match();
	printf("%d\n",ans);
	for(int i=1;i<=ans;++i){
		printf("%d\n",anss[i]);
	} 
	return 0;
}