#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair <int, int> pii;
typedef pair <ll, ll> pll;
#define long unsigned long
#define pb push_back
#define mp make_pair
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define lb lower_bound
#define ub upper_bound
#define sz(v) int((v).size())
#define do_not_disturb ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define endl '\n'
void solve() {
int n, l;
cin >> n >> l;
vector <int> v(n);
for (auto &to : v) cin >> to;
int q;
cin >> q;
vector <pii> queries(q);
for (int i = 0; i < q; i++) {
cin >> queries[i].first;
queries[i].second = i;
}
sort(all(queries));
vector <int> nxt(n+1);
for (int i = 0; i <= n; i++) {
auto it = lb(all(queries), mp(i, 0))-queries.begin();
nxt[i] = it;
}
vector <vector <int>> dp(q+1, vector <int> (n));
vector <vector <int>> partial(2, vector <int> (n));
for (int j = 1; j < n-l+1; j++) {
for (int k = 0; k < l; k++) {
partial[0][j] += (v[k] != v[j+k]);
}
dp[nxt[partial[0][j]]][0]++;
dp[nxt[partial[0][j]]][j]++;
}
for (int i = 1; i < n-l+1; i++) {
fill(all(partial[i&1]), 0);
for (int k = 0; k < l; k++) {
partial[i&1][0] += (v[k] != v[i+k]);
}
for (int j = 1; j < n-l+1; j++) {
if (i == j) continue;
partial[i&1][j] = partial[(i&1)^1][j-1]-(v[i-1] != v[j-1])+(v[i+l-1] != v[j+l-1]);
}
for (int j = 0; j < n-l+1; j++) {
if (i == j) continue;
dp[nxt[partial[i&1][j]]][i]++;
dp[nxt[partial[i&1][j]]][j]++;
}
}
vector <vector <int>> ans(q, vector <int> (n));
for (int i = 0; i < n-l+1; i++) for (int j = 1; j < q; j++) {
dp[j][i] += dp[j-1][i];
}
for (int j = 0; j < q; j++) {
ans[queries[j].second] = dp[j];
}
for (int j = 0; j < q; j++) {
for (int i = 0; i < n-l+1; i++) {
cout << ans[j][i]/2 << ' ';
}
cout << endl;
}
}
int main() {
do_not_disturb
int t = 1;
//~ cin >> t;
while (t--) {
solve();
}
return 0;
}
