CodeForces - 367B
Time Limit: 1000MS   Memory Limit: 262144KB   64bit IO Format: %I64d & %I64u

Submit Status

Description

Sereja has two sequences a and b and number p. Sequence a consists of n integers a1, a2, ..., an. Similarly, sequence bconsists of m integers b1, b2, ..., bm. As usual, Sereja studies the sequences he has. Today he wants to find the number of positions q(q + (m - 1)·p ≤ n; q ≥ 1), such that sequence b can be obtained from sequence aq, aq + p, aq + 2p, ..., aq + (m - 1)p by rearranging elements.

Sereja needs to rush to the gym, so he asked to find all the described positions of q.

Input

The first line contains three integers n, m and p(1 ≤ n, m ≤ 2·105, 1 ≤ p ≤ 2·105). The next line contains n integers a1,a2, ..., an(1 ≤ ai ≤ 109). The next line contains m integers b1, b2, ..., bm(1 ≤ bi ≤ 109).

Output

In the first line print the number of valid qs. In the second line, print the valid values in the increasing order.

Sample Input

Input
5 3 1 1 2 3 2 1 1 2 3
Output
2 1 3
Input
6 3 2 1 3 2 2 3 1 1 2 3
Output
2 1 2
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<map>
#define INF 0x3f3f3f3f
#define ull unsigned long long
#define ll long long
#define IN __int64
#define N 200010
#define M 1000000007
using namespace std;
int a[N];int ans[N];
int n,m,p;
map<int,int>A,B;
void ins(int x,int t)
{
	B[x]+=t;
	if(!B[x])
		B.erase(x);
}
int main()
{
	int x,i,j,k;
	scanf("%d%d%d",&n,&m,&p);
	if(1ll*(m-1)*p+1>n)
		printf("0\n");
	else
	{
		for(i=1;i<=n;i++)
			scanf("%d",&a[i]);
		for(i=1;i<=m;i++)
		{
			scanf("%d",&x);
			A[x]++;
		}
		int kk=0;
		for(i=1;i<=p;i++)
		{
			B.clear();
			for(j=i;j<=n;j+=p)
			{
				ins(a[j],1);
				k=j-m*p;
				if(k>0)
					ins(a[k],-1);
				k=j-(m-1)*p;
				if(k>0&&B==A)
					ans[++kk]=k;
			}
		}
		sort(ans+1,ans+kk+1);
		printf("%d\n",kk);
		for(i=1;i<=kk;i++)
			printf("%d ",ans[i]);
	}
	return 0;	
}