#include <bits/stdc++.h>
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define debug(x) cerr << #x << " = " << (x) << ' '
#define bug(x) cerr << (x) << ' '
#define endl cerr << '\n'
#define all(v) (v).begin(), (v).end()
#define SZ(v) (ll)(v).size()
#define lowbit(x) (x)&-(x)
#define pb emplace_back
#define F first
#define S second
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;
//#define TEST
const int N = 305;
int sum[N][N], a[N];
int main(void)
{ IO
int n, i, len, Q;
cin >> n >> len;
for (i=1; i <= n; ++i) cin >> a[i];
for (i=1; i <= n-len+1; ++i)
{
for (int j=1; j <= n-len+1; ++j)
{
if (i == j) continue;
int cnt = 0;
for (int k=0; k < len; ++k)
if (a[i+k] != a[j+k]) ++cnt;
++sum[cnt][i];
}
for (int j=1; j <= len; ++j) sum[j][i] += sum[j-1][i];
}
cin >> Q;
do {
int x; cin >> x;
for (i=1; i <= n-len+1; ++i) cout << sum[x][i] << ' ';
cout << '\n';
} while (--Q);
return 0;
}
