#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
#define sz(x) (int((x).size()))
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt(x) __builtin_popcount(x)
#define pb push_back
#define popf pop_front
#define popb pop_back
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
fastIO();
if (str != "") {
freopen((str + ".in").c_str(), "r", stdin);
freopen((str + ".out").c_str(), "w", stdout);
}
}
// Indexed Set
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
const int N = 1e4 + 10;
int n, l, q, a[N];
int dp[N][105], pat[N][105];
int pref[N];
void solve_() {
cin >> n >> l;
for(int i = 1; i <= n; i++) {
cin >> a[i];
}
cin >> q;
vector<pair<int, int>> qq;
for(int i = 0; i < q; i++) {
int kk; cin >> kk;
qq.push_back({kk, i});
}
sort(all(qq));
int m = n - l + 1;
for(int i = 1; i < n; i++) {
for(int j = 1; j + i <= n; j++) {
if(a[j] != a[j + i]) {
pref[j] = pref[j - 1] + 1;
} else {
pref[j] = pref[j - 1];
}
}
for(int j = 1; j + i + l - 1 <= n; j++) {
int s = pref[j + l - 1] - pref[j - 1];
auto it = lower_bound(all(qq), make_pair(s, -1));
if(it != qq.end()) {
pat[j][it - qq.begin()]++;
pat[i + j][it - qq.begin()]++;
}
}
}
for(int i = 1; i <= n; i++) {
for(int j = 1; j < q; j++) {
pat[i][j] += pat[i][j - 1];
}
}
vector<vector<int>> pt(q + 1);
int it = 0;
for(auto i: qq) {
vector<int> pi;
for(int j = 1; j <= m; j++) {
pi.push_back(pat[j][it]);
}
pt[i.second] = pi;
it++;
}
for(int i = 0; i < q; i++) {
for(auto j: pt[i]) {
cout << j << " ";
}
cout << '\n';
}
}
int main() {
fastIO();
auto solve = [&](int test_case)-> void {
while(test_case--) {
solve_();
}
};
int test_cases = 1;
// cin >> test_cases;
solve(test_cases);
return 0;
}
