#include <bits/stdc++.h>
using namespace std;
constexpr int INF = 1000000000;
int main() {
  int n, k;
  cin >> n >> k;
  vector<long long> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  map<long long, int> mymap;
  mymap[0] = 0;
  for (int i = 0; i < n; i++) {
    for (int j = 1; j <= k; j++) {
      auto itr = mymap.find(a[i] * j);
      if (itr != mymap.end()) {
        itr->second = min(itr->second, j);
      } else {
        mymap[a[i] * j] = j;
      }
    }
  }
  int q;
  cin >> q;
  while (q--) {
    long long x;
    cin >> x;
    long long ans = 1LL << 60;
    for (int i = 0; i < n; i++) {
      for (int j = 1; j <= k; j++) {
        long long x_ = x - a[i] * j;
        if (x_ < 0) continue;
        auto itr = mymap.find(x_);
        if (itr == mymap.end()) continue;
        ans = min(ans, (long long)itr->second + j);
      }
    }
    if (1 <= ans && ans <= k) {
      cout << ans << endl;
    } else {
      cout << -1 << endl;
    }
  }
  return 0;
}
