#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define rep(a,b,c) for(ll a=b;a<c;a++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

void get(vll &a){re(i,a.size()) scanf("%lld",&a[i]);}
void get(vvl &a){re(i,a.size()) re(j,a[0].size()) scanf("%lld",&a[i][j]);}
void print(vll &a){re(i,a.size()) cout<<a[i]<<(i==a.size()-1?"\n":" ");}
void print(vvl &a){re(i,a.size()) re(j,a[0].size())cout<<a[i][j]<<(j==a[0].size()-1?"\n":" ");}

int main(int argc, char const *argv[]) {
  ll n, k;std::cin >> n >> k;
  vll a(n);get(a);
  ll s = 0;
  vll t;
  for(int i=0;i<k;i++) s+=a[i];
  t.push_back(s);
  for(int i=k;i<n;i++){
    // a[i] ad
    // a[i-k] sub
    s += a[i] - a[i-k];
    t.push_back(s);
  }
  sort(all(t));
  ll q;std::cin >> q;
  //for(auto e:t) std::cout << e << " ";
  //std::cout << '\n';

  re(i, q){
    ll x;std::cin >> x;
    ll ans = upper_bound(all(t), x) - t.begin();
    std::cout << ans << '\n';
  }
  return 0;
}