#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 <int> queries(q);
for (auto &to : queries) cin >> to;
if (n <= 300) {
vector <vector <int>> dp(n-l+1, vector <int> (l+1)), intervals(n-l+1);
for (int i = 0; i < n-l+1; i++) {
for (int j = 0; j < l; j++) {
intervals[i].pb(v[i+j]);
}
}
for (int i = 0; i < n-l+1; i++) {
for (int j = i+1; j < n-l+1; j++) {
int cnt = 0;
for (int k = 0; k < l; k++) {
cnt += (intervals[i][k] != intervals[j][k]);
}
dp[i][cnt]++;
dp[j][cnt]++;
}
}
for (int i = 0; i < n-l+1; i++) {
for (int j = 1; j <= l; j++) dp[i][j] += dp[i][j-1];
}
for (auto to : queries) {
for (int i = 0; i < n-l+1; i++) cout << dp[i][to] << ' ';
cout << endl;
}
return;
}
if (q > 1 || queries[0] != 0) return;
const ll P = 31;
vector <ll> hash(n), p(n);
p[0] = 1;
for (int i = 1; i < n; i++) p[i] = p[i-1] * P;
for (int i = 0; i < n; i++) {
hash[i] = v[i] * p[i];
if (i) hash[i] += hash[i-1];
}
set <ll> st;
map <ll, vector <int>> pos;
for (int i = 0; i < n-l+1; i++) {
ll h = hash[i+l-1];
if (i) h -= hash[i-1];
h *= p[n-i-1];
//~ cout << h << ' ';
pos[h].pb(i);
st.insert(h);
}
vector <int> ans(n-l+1);
for (auto to : st) {
for (auto x : pos[to]) ans[x] = sz(pos[to])-1;
}
for (auto to : ans) cout << to << ' ';
}
int main() {
//~ freopen("in.txt", "r", stdin);
do_not_disturb
int t = 1;
//~ cin >> t;
while (t--) {
solve();
}
return 0;
}
