#include <bits/stdc++.h>
using namespace std;
mt19937_64 random_num(
    chrono::high_resolution_clock::now().time_since_epoch().count());
const int MOD = 1000000007;
const int inf = 2000000000;
const int mod = 1007050321;
const double e = 0.000001;
const int N = 200005;
const bool aut = 788480;
const int base = 521;
int n, m, p, b[N], a[N];
int poww(int n, int a) {
  if (n == 1) return a;
  if (n == 0) return 0;
  int t = poww(n / 2, a);
  t = 1LL * t * t % MOD;
  if (n & 1) t = 1LL * t * a % MOD;
  return t;
}
int main() {
  ios_base ::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> m >> p;
  vector<int> pack;
  for (int i = 1; i <= n; ++i) cin >> a[i], pack.push_back(a[i]);
  for (int i = 1; i <= m; ++i) cin >> b[i], pack.push_back(b[i]);
  sort((pack).begin(), (pack).end());
  for (int i = 1; i <= n; ++i)
    a[i] = lower_bound((pack).begin(), (pack).end(), a[i]) - pack.begin() + 1;
  for (int i = 1; i <= m; ++i)
    b[i] = lower_bound((pack).begin(), (pack).end(), b[i]) - pack.begin() + 1;
  vector<int> ans;
  long long S = 0, T = 1;
  for (int i = 1; i <= m; ++i) S += b[i], T = 1LL * T * b[i] % MOD;
  for (int i = 1; i <= p; ++i) {
    long long sum = 0;
    int mul = 1;
    if ((n - i) / p < m - 1) break;
    for (int j = 0; j <= m - 1; ++j) {
      sum += a[i + j * p];
      mul = 1LL * mul * a[i + j * p] % MOD;
    }
    if (sum == S && mul == T) ans.push_back(i);
    for (int j = m; i + j * p <= n; ++j) {
      sum += a[i + j * p] - a[i + (j - m) * p];
      mul = 1LL * mul * poww(MOD - 2, a[i + (j - m) * p]) % MOD * a[i + j * p] %
            MOD;
      if (mul == T && sum == S) ans.push_back(i + (j - m + 1) * p);
    }
  }
  sort((ans).begin(), (ans).end());
  cout << ans.size() << "\n";
  for (int v : ans) cout << v << " ";
  return 0;
}
