#include <bits/stdc++.h>
using namespace std;
long long modpow(long long a, long long p, long long mod) {
  long long ret = 1;
  while (p) {
    if (p & 1) ret = (ret * a) % mod;
    a = (a * a) % mod;
    p /= 2;
  }
  return ret;
}
long long power(long long a, long long p) {
  long long ret = 1;
  while (p) {
    if (p & 1) ret = (ret * a);
    a = (a * a);
    p /= 2;
  }
  return ret;
}
bool arr[10000001] = {0};
vector<int> vec;
int main() {
  int i, j, tmp;
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);
  int n, k, q, ii;
  cin >> n >> k;
  for (i = 0; i < n; i++) {
    cin >> tmp;
    arr[tmp]++;
    vec.push_back(tmp);
  }
  cin >> q;
  while (q--) {
    int ans = 100;
    cin >> tmp;
    int t = tmp;
    for (i = 0; i < k + 1; i++) {
      t = tmp;
      for (j = 0; j < (int)(vec.size()); j++) {
        t = tmp;
        t -= (i * vec[j]);
        if (t == 0) {
          ans = min(ans, i);
          continue;
        }
        if (t < 0) continue;
        for (ii = 0; ii < k - i + 1; ii++) {
          if ((ii) && (t % ii == 0) && ((t / ii) <= 10000000))
            if (arr[t / ii] == 1) ans = min(ans, i + ii);
        }
      }
    }
    if (ans == 100) ans = -1;
    cout << ans << endl;
  }
  return 0;
}
