#include <bits/stdc++.h>
using namespace std;
ifstream fin("A.in");
ofstream fout("A.out");
unordered_map<int, int> M;
int a[5010], n, k, q;
int main() {
  cin >> n >> k;
  M[0] = 0;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    int x = 0;
    for (int j = 1; j <= k; ++j) {
      x += a[i];
      if (M.find(x) == M.end())
        M[x] = j;
      else
        M[x] = min(M[x], j);
    }
  }
  cin >> q;
  for (int i = 1; i <= q; ++i) {
    int x;
    cin >> x;
    int ans = k + 1;
    for (int j = 1; j <= n; ++j) {
      for (int h = 1; h <= k; ++h) {
        if (M.find(x - h * a[j]) != M.end()) {
          ans = min(ans, h + M[x - h * a[j]]);
        }
      }
    }
    if (ans == k + 1)
      cout << -1;
    else
      cout << ans;
    cout << "\n";
  }
}
