#include<bits/stdc++.h>
#include<fstream>
using namespace std;
ifstream fin("HCN.INP");
ofstream fout("HCN.OUT");
#define sz(a) (int)a.size()
#define ll long long
#define pb push_back
#define forr(i, a, b) for(int i = a; i < b; i++)
#define dorr(i, a, b) for(int i = a; i >= b; i--)
#define ld long double
#define vt vector
#include<fstream>
#define fi first
#define se second
#define pll pair<ll, ll>
#define pii pair<int, int>
const ld PI = 3.14159265359;
//using u128 = __uint128_t;
//const int x[4] = {1, -1, 0, 0};
//const int y[4] = {0, 0, 1, -1};
const ll mod = 1e9 + 9;
const int mxn = 1e5 + 5, mxq = 2e5 + 5, sq = 200, mxv = 2e6 + 5;
const ll inf = 1e17 + 5;
//const int base= (1 << 18);
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
int n, l;
int a[2005], pref[4005][2005];
int get(int diag, int l, int r){
return(pref[diag][r] - pref[diag][l - 1]);
}
signed main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
cin >> n >> l;
for(int i = 1; i <= n; i++)cin >> a[i];
for(int i = 1; i <= n + n - 1; i++){
for(int row = 1; row <= n; row++){
int col = i - n + row;
if(col <= 0 || col > n)continue;
pref[i][row] = pref[i][row - 1] + (a[row] != a[col]);
}
}
int q; cin >> q;
while(q--){
int k; cin >> k;
for(int i = 1; i + l - 1 <= n; i++){
int cnt = 0;
for(int j = 1; j + l - 1 <= n; j++){
if(i != j)cnt += (get(j - i + n, i, i + l - 1) <= k);
}
cout << cnt << " ";
}
cout << "\n";
}
return(0);
}
