#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 100;
struct node {
  int val, cnt;
  node(int n1 = 0, int n2 = 0) { val = n1, cnt = n2; }
  friend bool operator<(const node n1, const node n2) {
    if (n1.val == n2.val) return n1.cnt < n2.cnt;
    return n1.val < n2.val;
  }
} p[maxn];
int num;
int main() {
  int n, k, m, a, q;
  scanf("%d %d", &n, &k);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a);
    for (int j = 1; j <= k; j++) p[++num] = node(a * j, j);
  }
  sort(p + 1, p + num + 1);
  scanf("%d", &m);
  while (m--) {
    scanf("%d", &q);
    int ans = k + 1;
    for (int i = 1; i <= num; i++) {
      if (p[i].val == p[i - 1].val) continue;
      if (p[i].val > q) break;
      if (p[i].val == q) {
        if (p[i].cnt <= k) ans = min(ans, p[i].cnt);
        break;
      }
      int ned = q - p[i].val;
      int l = 0, r = num + 1;
      while (r - l > 1) {
        int mid = (l + r) >> 1;
        if (p[mid].val >= ned)
          r = mid;
        else
          l = mid;
      }
      if (p[r].val != ned) continue;
      if (p[r].cnt + p[i].cnt <= k) ans = min(ans, p[r].cnt + p[i].cnt);
    }
    if (ans > k)
      printf("-1\n");
    else
      printf("%d\n", ans);
  }
  return 0;
}
