#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

int main() {
  int N, K;
  cin>>N>>K;
  int a[N];
  for(int i=0;i<N;++i) cin>>a[i];
  vector<int> S;
  int tmp = 0;
  for(int i=0;i<K;++i){
    tmp += a[i];
  }
  S.push_back(tmp);
  for(int i=K;i<N;++i){
    tmp -= a[i-K];
    tmp += a[i];
    S.push_back(tmp);
  }
  sort(S.begin(), S.end());
  int Q;
  cin>>Q;
  int x;
  int ans[Q];
  for(int i=0;i<Q;++i){
    cin>>x;
    ans[i] = upper_bound(S.begin(), S.end(), x) - S.begin();
  }
  for(int i=0;i<Q;++i){
    cout<<ans[i]<<endl;
  }
}