#include <bits/stdc++.h>
using namespace std;
const int N = 5e3 + 111;
long long a[N];
long long n, k, q, x, ans;
map<long long, long long> cnt;
int main() {
  cin >> n >> k;
  for (long long i = 1; i <= n; i++) {
    cin >> a[i];
  }
  sort(a + 1, a + n + 1);
  for (long long i = 1; i <= n; i++) {
    for (long long j = 1; j <= k; j++) {
      cnt[a[i] * j] = j;
    }
  }
  cin >> q;
  for (long long t = 1; t <= q; t++) {
    cin >> x;
    long long ans = 1e9;
    for (long long i = 1; i <= n; i++) {
      for (long long j = 1; j <= k; j++) {
        if (a[i] * j > x) break;
        if (a[i] * j == x) {
          ans = min(ans, j);
        } else if (cnt[x - a[i] * j] > 0) {
          ans = min(ans, j + cnt[x - a[i] * j]);
        }
      }
    }
    if (ans <= k)
      cout << ans << endl;
    else
      cout << -1 << endl;
  }
  return 0;
}
