#include <bits/stdc++.h>
using namespace std;
const int N = 101010;
int n, k, cntb, q;
int a[N];
pair<int, int> b[N];
int main() {
  std::ios::sync_with_stdio(false);
  std::cin.tie(0);
  cin >> n >> k;
  for (int i = (1); i < (n + 1); i++) cin >> a[i];
  for (int i = (1); i < (n + 1); i++) {
    for (int j = (1); j < (k + 1); j++) {
      b[++cntb] = make_pair(a[i] * j, j);
    }
  }
  sort(b + 1, b + 1 + cntb);
  cin >> q;
  while (q--) {
    int x, ans = k + 1;
    cin >> x;
    for (int i = (1); i < (n + 1); i++)
      for (int j = (1); j < (k + 1); j++)
        if (a[i] * j <= x) {
          if (a[i] * j == x) {
            ans = min(ans, j);
            continue;
          }
          int t = x - a[i] * j;
          int p = lower_bound(b + 1, b + 1 + cntb, make_pair(t, 0)) - b;
          if (b[p].first == t) {
            ans = min(ans, b[p].second + j);
          }
        }
    if (ans == k + 1) ans = -1;
    cout << ans << "\n";
  }
  return 0;
}
