#include <bits/stdc++.h>
using namespace std;
template <class T>
inline T bigmod(T p, T e, T M) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p) % M;
    p = (p * p) % M;
  }
  return (T)ret;
}
template <class T>
inline T gcd(T a, T b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
template <class T>
inline T bpow(T p, T e) {
  long long int ret = 1;
  for (; e > 0; e >>= 1) {
    if (e & 1) ret = (ret * p);
    p = (p * p);
  }
  return (T)ret;
}
int toInt(string s) {
  int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int toLlint(string s) {
  long long int sm;
  stringstream ss(s);
  ss >> sm;
  return sm;
}
int a[5005], al[5005][21], n, k;
map<int, char> mct;
map<int, char>::iterator it;
int main() {
  int t, i, j, q, x, mn, qx;
  mct[0] = 0;
  scanf("%d%d", &n, &k);
  for (i = 0; i < n; i++) {
    scanf("%d", &a[i]);
    for (j = 1; j <= k; j++) {
      al[i][j] = a[i] * j;
      it = mct.find(al[i][j]);
      if (it == mct.end())
        mct[al[i][j]] = j;
      else
        it->second = min(it->second, (char)j);
    }
  }
  scanf("%d", &q);
  while (q--) {
    scanf("%d", &x);
    mn = 25;
    for (i = 0; i < n; i++) {
      for (j = 1; j <= k && al[i][j] <= x; j++) {
        it = mct.find(x - al[i][j]);
        if (it != mct.end() && j + it->second <= k && j + it->second < mn) {
          mn = j + it->second;
        }
      }
    }
    if (mn == 25) mn = -1;
    printf("%d\n", mn);
  }
  return 0;
}
