#include <bits/stdc++.h>
using namespace std;
inline string toString(long long x) {
  string ans = "";
  bool negtive = x < 0;
  while (x) ans.push_back(x % 10 + '0'), x /= 10;
  if (ans.size() == 0) ans = "0";
  if (negtive) ans.push_back('-');
  for (long long i = 0; i < ans.size() / 2; i++)
    swap(ans[i], ans[ans.size() - 1 - i]);
  return ans;
}
inline long long toInt(const string &str) {
  long long ans = 0;
  bool negtive = str[0] == '-';
  for (long long i = negtive; i < str.size(); i++)
    ans = ans * 10 + str[i] - '0';
  if (negtive) ans *= -1;
  return ans;
}
inline long long gcd(long long x, long long y) { return x ? gcd(y % x, x) : y; }
const long long mod = 1e9 + 7;
inline signed rd() {
  signed ans = 0;
  char last = ' ', ch = getchar();
  while (!(ch >= '0' && ch <= '9')) last = ch, ch = getchar();
  while (ch >= '0' && ch <= '9')
    ans = (ans << 3) + (ans << 1) + ch - '0', ch = getchar();
  return ans;
}
inline long long QPow(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
inline long long QPow(long long a, long long b, const long long &mod) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans = ans * a % mod;
    a = a * a % mod;
    b >>= 1;
  }
  return ans;
}
long long exgcd(long long a, long long b, long long &x, long long &y) {
  long long d = a;
  if (b == 0)
    x = 1, y = 0;
  else {
    d = exgcd(b, a % b, y, x), y -= a / b * x;
  }
  return d;
}
const long double PI = 3.141592653589793115997963468544185161590576171875;
const long long inf = 1e9;
const long long maxn = 5002;
long long arr[maxn];
inline long long check(long long n, long long x, long long k) {
  long long ans = mod;
  for (long long i = n; i >= 1; i--) {
    for (long long j = 1; j <= k; j++) {
      if (x - j * arr[i] < 0) break;
      if (x == j * arr[i]) {
        if (j == k) ans = k;
      } else {
        if (j != k) {
          long long tmp = (x - j * arr[i]) / (k - j);
          if ((x - j * arr[i]) % (k - j)) continue;
          signed id = lower_bound(arr + 1, arr + 1 + n, tmp) - arr;
          if (arr[id] == tmp) ans = k;
        }
      }
    }
  }
  return ans;
}
signed main() {
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  long long t, m, x, c, n, s, y, k, q;
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) cin >> arr[i];
  cin >> q;
  while (q--) {
    cin >> x;
    long long ans = mod;
    for (long long i = 1; i <= k; i++) ans = min(ans, check(n, x, i));
    cout << (ans == mod ? -1 : ans) << endl;
  }
  return 0;
}
