codeforces 367B Sereja ans Anagrams

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


Example
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

在1~p中的任意一个数i都可以由(i+j*p)求出一段数列，如果是大于p的数根据规则生成的数列一定是由i生成数列的子序列，所以仅讨论1~p就可以了（当然q的值不限于此范围），维护一个m元素的队列，用map来判断两个序列是否相等。

#include<map>
#include<cstdio>
#include<queue>
#include<algorithm>
using namespace std;
const int M = 2e5 + 5;
queue<int> q;
map<int, int> mapa, mapb;
int a[M], ans[M];
int t;
int main()
{
    int n, m, p, tmp;
    scanf("%d%d%d", &n, &m, &p);
    for(int i=1;i<=n;i++)
        scanf("%d", &a[i]);
    for(int i=1;i<=m;i++)
    {
        scanf("%d", &tmp);
        mapb[tmp]++;
    }
    for(int i=1;i<=p;i++)
    {
        while(!q.empty())
            q.pop();
        mapa.clear();
        for(int j=i;j<=n;j+=p)
        {
            q.push(j);
           // printf("%d\n", j);
            mapa[a[j]]++;
            if(q.size()==m)
            {
                tmp = q.front();
             //   printf("%d",tmp);
                if(mapa==mapb)
                    ans[t++] = tmp;
                q.pop();
                mapa[a[tmp]]--;
                if(mapa[a[tmp]]==0)
                    mapa.erase(a[tmp]);
            }
        }
    }
    printf("%d\n", t);
    sort(ans, ans+t);
    for(int i=0;i<t;i++)
    {
        printf("%d", ans[i]);
        if(i!=t-1)
            printf(" ");
    }
    return 0;
}