#include <bits/stdc++.h>
using namespace std;
bool first[10000011];
int main() {
  int n, k;
  cin >> n >> k;
  long long a[n];
  for (int i = 0; i < n; i++) cin >> a[i], first[a[i]] = 1;
  long long q, x;
  cin >> q;
  while (q--) {
    cin >> x;
    long long ans = 10000000000000000;
    for (int i = 0; i < n; i++) {
      if (x % a[i] == 0) {
        ans = min(ans, x / a[i]);
      } else {
        for (long long p = 1;; p++) {
          if (p > k) break;
          if (p * a[i] > x) break;
          for (long long q = 1;; q++) {
            if (q > k - p) break;
            if ((x - p * a[i]) % q == 0 and (x - p * a[i]) / q <= 10000000 and
                first[(x - p * a[i]) / q] == 1) {
              ans = min(ans, p + q);
            }
          }
        }
      }
    }
    if (ans <= k) {
      cout << ans << "\n";
    } else {
      cout << -1 << "\n";
    }
  }
}
