#include<iostream>
#include<cstring>
#include<cstdio>
#define MAXN 100010
#define MAXK  25010
using namespace std;
	int n,s,k;
	int t[MAXN]={0},p[MAXK]={0};
	int next[MAXK]={0};
	int ans[MAXN]={0};
	int cnt=0;
bool check1(int x,int y)
{
	if((p[y]>p[y+1]&&p[x-1]>p[x])||(p[y]<p[y+1]&&p[x-1]<p[x])||(p[y]==p[y+1]&&p[x-1]==p[x]))
		return 1;
	else return 0;
}
void getnext()
{
	for(int i=2;i<k;i++)
	{
		int j=next[i-1];
		while(j&&!check1(i,j))
			j=next[j];
		if(check1(i,j))
			next[i]=j+1;
		else next[i]=0;
	}
}
bool check2(int x,int y)
{
	if(p[y]>p[y-1]&&t[x]>t[x-1]&&p[y]-p[y-1]<=t[x]-t[x-1])
		return true;
	else
		if(p[y]==p[y-1]&&t[x]==t[x-1])
			return true;
		else
			if(p[y]<p[y-1]&&t[x]<t[x-1]&&p[y-1]-p[y]<=t[x-1]-t[x])
				return true;
			else
				return false;
}
void KMP()
{
	int j=0,s=0;
	for(int i=0;i<n;i++)
	{
		if(!j)
		{
			s=1;
			j++;
			i++;
		}
		while(j&&!check2(i,j))
			j=next[j];
		if(j&&check2(i,j))
		{
			s++;
			j++;
		}
		if(s==k)
		{
			s=0;
			ans[cnt]=i-k+1;
			cnt++;
		}
	}
}
int main()
{
	freopen("cpattern.in","r",stdin);
	freopen("cpattern.out","w",stdout);
	scanf("%d",&n);scanf("%d",&k);scanf("%d",&s);
	for(int i=0;i<n;i++)
		scanf("%d",&t[i]);
	for(int i=0;i<k;i++)
		scanf("%d",&p[i]);
	getnext();
	KMP();
	printf("%d\n",cnt);
	for(int i=0;i<cnt;i++)
		printf("%d\n",ans[i]+1);
return 0;
}