Sereja ans Anagrams

1000ms

262144K

Description:

Sereja has two sequences a and b and number p. Sequence a consists of n integers a₁, a₂, ..., a_n. Similarly, sequence b consists of m integers b₁, b₂, ..., b_m. 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 a_q, a_q + p, a_q + 2p, ..., a_{q + (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·10⁵, 1 ≤ p ≤ 2·10⁵). The next line contains n integers a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹). The next line contains m integers b₁, b₂, ..., b_m (1 ≤ b_i ≤ 10⁹).

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:

5 3 1
1 2 3 2 1
1 2 3

Sample Output:

2
1 3

Sample Input:

6 3 2
1 3 2 2 3 1
1 2 3

Sample Output:

2
1 2

Informação

Provedor Codeforces

Código CF367B