/* -*- coding: utf-8 -*-
 *
 * 1890.cc:  No.1890 Many Sequences Sum Queries - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 100;
const int MAX_M = MAX_N * (MAX_N + 1) / 2;

/* typedef */

/* global variables */

int as[MAX_N], ass[MAX_N + 1];
int ps[MAX_N + 1], ss[MAX_N + 1];

/* subroutines */

int check(int n, int m) {
  int k = upper_bound(ps, ps + n + 1, m) - ps - 1;
  int v = ss[k] + ass[m - ps[k]];
  //printf(" check(%d,%d) = %d\n", n, m, v);
  return v;
}

/* main */

int main() {
  int n, qn;
  scanf("%d%d", &n, &qn);

  for (int i = 0; i < n; i++)
    scanf("%d", as + i), ass[i + 1] = ass[i] + as[i];

  ps[0] = ss[0] = 0;
  for (int i = 1; i <= n; i++) {
    ps[i] = ps[i - 1] + i;
    ss[i] = ss[i - 1] + ass[i];
  }
  //for (int i = 0; i <= n; i++) printf("%d,%d ", ps[i], ss[i]); putchar('\n');

  int maxm = n * (n + 1) / 2;

  while (qn--) {
    int si;
    scanf("%d", &si);

    int m0 = -1, m1 = maxm + 1;

    while (m0 + 1 < m1) {
      int m = (m0 + m1) / 2;
      if (check(n, m) >= si) m1 = m;
      else m0 = m;
    }

    printf("%d\n", (m1 > maxm) ? -1 : m1);
  }
  return 0;
}