#include <bits/stdc++.h>
using namespace std;
const int N = 100005;
int a[N];
int main() {
  int n, k;
  cin >> n >> k;
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  sort(a, a + n);
  int q;
  cin >> q;
  while (q--) {
    int sutta;
    cin >> sutta;
    int ans = INT_MAX;
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < k + 1; j++) {
        int x = (sutta - j * a[i]);
        if (x < 0) break;
        if (x == 0)
          ans = min(ans, j);
        else {
          for (int p = 1; p < k - j + 1; p++) {
            if (x % p == 0) {
              if (a[lower_bound(a, a + n, x / p) - a] == x / p)
                ans = min(ans, j + p);
            }
          }
        }
      }
    }
    if (ans != INT_MAX) {
      cout << ans << endl;
    } else {
      cout << -1 << endl;
    }
  }
  return 0;
}
