http://codeforces.com/contest/368/problem/D

D. Sereja ans Anagrams

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Sereja has two sequences a and b and number p. Sequence a consists of n integers a1, a2, ..., an. Similarly, sequence b consists of mintegers 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 test(s)

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 <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <queue>
#include <algorithm>
#include <map>
#include <iomanip>
#define INF 2000000000
typedef long long LL;
using namespace std;

const int MAX=2*100000+10;
int a[MAX],b[MAX];
//pos记录a这个值对应b哪个位置,suma记录a对应 b的那个位置有多少个,sumb记录b的某个位置数有多少个
int pos[MAX],suma[MAX],sumb[MAX];
bool mark[MAX],flag[MAX];

int search(int l,int r,int x){
    while(l<=r){
        int mid=l+r>>1;
        if(x == b[mid])return mid;
        if(x < b[mid])r=mid-1;
        else l=mid+1;
    }
    return 0;
}

int main(){
    int n,m,p,M;
    while(~scanf("%d%d%d",&n,&m,&p)){
        M=m;
        for(int i=1;i<=n;++i)scanf("%d",&a[i]);
        for(int i=1;i<=m;++i)scanf("%d",&b[i]);
        sort(b+1,b+m+1);
        b[m+1]=INF,m=1,sumb[1]=1;
        for(int i=2;b[i] != INF;++i){
            if(b[i] != b[i-1])b[++m]=b[i],sumb[m]=1;
            else ++sumb[m];
        }
        memset(mark,false,sizeof mark);
        memset(flag,false,sizeof flag);
        int ans=0;
        for(int i=1,x=1,y=1;i<=n;x=y=++i){
            if(mark[x])continue;
            for(;y<=n;y=y+p){
            	mark[y]=true;
                int k=search(1,m,a[y]);
                pos[y]=k;
                if(k == 0){ans=0;while(x<=y){suma[pos[x]]=0,x+=p;}}
                else{
                    ++suma[pos[y]];
                    if(suma[pos[y]]>sumb[pos[y]]){
                        while(pos[x] != pos[y]){
                            if(suma[pos[x]] == sumb[pos[x]])--ans;
                            --suma[pos[x]];
                            x+=p;
                        };
                        --suma[pos[y]];
                        x+=p;
                    }else if(suma[pos[y]] == sumb[pos[y]])++ans;
                    if(ans == m && x+(M-1)*p == y)flag[x]=true;
                    if(x+(M-1)*p<y){
                        if(suma[pos[x]] == sumb[pos[x]])--ans;
                        --suma[pos[x]];
                        x+=p;
                    }
                }
            }
            ans=0;
            while(x<y){suma[pos[x]]=0,x+=p;}
        }
        ans=0;
        for(int i=1;i<=n;++i)if(flag[i])++ans;
        cout<<ans<<endl;
        for(int i=1;i<=n;++i)if(flag[i])cout<<i<<endl;
    }
    return 0;
}