#include <bits/stdc++.h>
using namespace std;
int main() {
  long long n, k;
  cin >> n >> k;
  vector<long long> d(n);
  for (long long i = 0; i < n; i++) {
    cin >> d[i];
  }
  long long q;
  cin >> q;
  vector<long long> z(q);
  for (long long i = 0; i < q; i++) {
    cin >> z[i];
  }
  map<long long, long long> m;
  for (long long i = 0; i < n; i++)
    for (long long j = 1; j < k + 1; j++) {
      m[d[i] * j] = j;
    }
  for (long long i = 0; i < q; i++) {
    long long ans = 1000000000;
    for (long long y = 0; y < n; y++) {
      for (long long j = 1; j < k + 1; j++) {
        if (z[i] - j * d[y] == 0)
          ans = min(ans, j);
        else if (m[z[i] - j * d[y]] != 0)
          ans = min(ans, j + m[z[i] - j * d[y]]);
      }
    }
    if (ans <= k)
      cout << ans << endl;
    else
      cout << -1 << endl;
  }
  return 0;
}
