/// In The Name Of God
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = (int)2000 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using namespace std;
int n, l;
int a[N];
int diff(int x, int y) {
int cnt = 0;
rep(i, 0, l - 1) cnt += a[x + i] != a[y + i];
return cnt;
}
int cnt[N][N];
int main() {
#ifdef IOI2018
freopen ("in.txt", "r", stdin);
#endif
Kazakhstan
cin >> n >> l;
rep(i, 1, n) cin >> a[i];
rep(i, 1, n - l + 1) {
rep(j, 1, n - l + 1) {
cnt[i][diff(i, j)]++;
}
rep(j, 1, n) cnt[i][j] += cnt[i][j - 1];
}
int q;
cin >> q;
while (q--) {
int k;
cin >> k;
rep(i, 1, n - l + 1) {
cout << cnt[i][k] - 1 << ' ';
}
cout << nl;
}
ioi
}
