import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const L = readLong;
      auto C = new long[N];
      foreach (i; 0 .. N) {
        C[i] = readLong;
      }
      const Q = readInt;
      auto K = new long[Q];
      foreach (q; 0 .. Q) {
        K[q] = readLong;
      }
      
      auto lbs = new long[N];
      auto ubs = new long[N];
      long calc() {
        auto sums = new long[1 << N];
        foreach (i; 0 .. N) {
          foreach (p; 0 .. 1 << i) {
            sums[p | 1 << i] = sums[p] + (ubs[i] + 1);
            sums[p] += lbs[i];
          }
        }
        long ret;
        foreach (p; 0 .. 1 << N) {
          const lot = L - sums[p];
          if (lot >= 0) {
            long num = 1;
            foreach (j; 1 .. N) {
              num *= (lot + j);
              num /= j;
            }
            ret += ((popcnt(p)&1)?-1:+1) * num;
          }
        }
        return ret;
      }
      ubs[] = C[];
      const all = calc();
      debug {
        writeln("all = ", all);
      }
      
      foreach (q; 0 .. Q) {
        if (K[q] > all) {
          writeln("-1");
        } else {
          lbs[] = 0;
          ubs[] = C[];
          long k = K[q];
          foreach (i; 0 .. N - 1) {
            long lo = 0, hi = ubs[i] + 1;
            for (; lo + 1 < hi; ) {
              const mid = (lo + hi) / 2;
              lbs[i] = mid;
              ((calc() >= k) ? lo : hi) = mid;
            }
            lbs[i] = lo + 1;
            k -= calc();
            lbs[i] = ubs[i] = lo;
            debug {
              writefln("  lo = %s, k = %s", lo, k);
            }
          }
          foreach (i; 0 .. N - 1) {
            write(lbs[i], " ");
          }
          writeln(L - lbs.sum);
        }
      }
    }
  } catch (EOFException e) {
  }
}