#include <bits/stdc++.h>
using namespace std;
map<int, int> d;
vector<int> v;
int n, k, a[5005], q, x;
void input() {
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i]);
  }
}
void solve() {
  input();
  for (int i = 0; i < n; i++) {
    for (int j = 1; j <= k; j++) {
      if (!d[a[i] * j])
        d[a[i] * j] = j;
      else
        d[a[i] * j] = min(d[a[i] * j], j);
      v.push_back(a[i] * j);
    }
  }
  sort(v.begin(), v.end());
  v.erase(unique(v.begin(), v.end()), v.end());
  scanf("%d", &q);
  while (q--) {
    scanf("%d", &x);
    int re = 100;
    for (int i = 0; i < n; i++) {
      for (int j = 1; j <= k; j++) {
        if (a[i] * j == x)
          re = min(re, j);
        else if (a[i] * j < x &&
                 binary_search(v.begin(), v.end(), x - a[i] * j)) {
          re = min(re, j + d[x - a[i] * j]);
        }
      }
    }
    if (re <= k)
      printf("%d\n", re);
    else
      puts("-1");
  }
}
int main(void) {
  solve();
  return 0;
}
