#include <iostream>
#include <fstream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <set>
#include <map>
#include <queue>
#include <list>
#include <utility>
#include <cmath>
#include <numeric>
#include <assert.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pb push_back
#define endl "\n"
#define all(x) x.begin(), x.end()
const int M = 307;
const ll inf = 1e9;
const ll mod = 1e9 + 7;
const double pi = acos(-1);
const int dx[] = {1, 0, -1, 0}, dy[] = {0, 1, 0, -1};
int n, l, q, a[M], ans[M][M];
int main()
{
ios::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 + l - 1 <= n; ++i){
for(int j = i + 1; j + l - 1 <= n; ++j){
int cnt = 0;
for(int k = 0; k < l; ++k) cnt += (a[i + k] != a[j + k]);
++ans[i][cnt];
++ans[j][cnt];
}
}
for(int i = 1; i <= n; ++i) for(int j = 1; j <= l; ++j) ans[i][j] += ans[i][j - 1];
cin >> q;
while(q--){
int k;
cin >> k;
for(int i = 1; i <= n - l + 1; ++i) cout << ans[i][k] << " ";
cout << endl;
}
return 0;
}
