//apig's property
//Happiness can be found, even in the darkest of times, if one only remembers to turn on the light
//El Pueblo Unido Jamas Sera Vencido
//Do or do not... there is no try
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#include<bits/stdc++.h>
#define fast ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(o) o ; break
#define co(o) o ; continue
using namespace std;
typedef int ll;
ll q, dp1[2005][2005] , a[2005] , k, l, m, n, o, p;
void solve(){
cin >> n >> l ;
for(ll i = 1 ; i <= n ; i++){
cin >> a[i] ;
}
for(ll i = 1 ; i <= n - l + 1 ; i++){
for(ll j = i + 1 ; j <= n - l + 1 ; j++){
k = 0 ;
for(ll j1 = 0 ; j1 < l ; j1++){
k += (a[i + j1] != a[j + j1]) ;
}
dp1[i][k]++ , dp1[j][k]++ ;
}
}
for(ll i = 1 ; i <= n - l + 1; i++){
for(ll j = 1 ; j <= n - l + 1 ; j++){
dp1[i][j] += dp1[i][j - 1] ;
}
}
cin >> m ;
while(m--){
cin >> k ;
for(ll i = 1 ; i <= n - l + 1; i++){
cout << dp1[i][k] << " " ;
}
cout << endl ;
}
}
int main(){
fast ;
q = 1 ;
//cin >> q ;
while(q--){
solve() ;
}
}
