#include <bits/stdc++.h>
using namespace std;
int n, k;
int a[5005];
struct node {
  int cost, w;
  node(int co, int w) : cost(co), w(w){};
};
vector<node> p;
vector<node>::iterator it;
bool cmp(node a, node b) {
  if (a.cost == b.cost) return a.w < b.w;
  return a.cost < b.cost;
}
int main() {
  int n, k;
  p.push_back(node(0, 0));
  scanf("%d%d", &n, &k);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    for (int j = 1; j <= k; j++) {
      p.push_back(node(a[i] * j, j));
    }
  }
  sort(p.begin(), p.end(), cmp);
  int q, m;
  scanf("%d", &q);
  int ans;
  for (int t = 1; t <= q; t++) {
    scanf("%d", &m);
    ans = k + 1;
    for (int i = 1; i <= n; i++) {
      for (int j = 1; j <= k; j++) {
        if (m < a[i] * j) continue;
        int re = m - a[i] * j;
        it = lower_bound(p.begin(), p.end(), node(re, 0), cmp);
        if (it != p.end() && it->cost == re) ans = min(ans, it->w + j);
      }
    }
    if (ans > k)
      cout << -1 << endl;
    else
      cout << ans << endl;
  }
  return 0;
}
