#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;
//~ if (n <= 300) {
//~ int
//~ }
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];
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]);
}
int q;
cin >> q;
while (q--) {
int x;
cin >> x;
for (auto to : ans) cout << to << ' ';
cout << endl;
}
}
int main() {
do_not_disturb
int t = 1;
//~ cin >> t;
while (t--) {
solve();
}
return 0;
}
