#include <bits/stdc++.h>

using namespace std;

const int N = 1e5;

typedef long long LL;

LL a[N], s[N], t[N];
int p = 1;

bool cmp(int a, int b)
{
    return a > b;
}

int main()
{
    int n, m;
    cin >> n >> m;

    for (int i = 1; i <= n; i ++ ) cin >> a[i];
    sort(a + 1, 1 + a + n, cmp);
    for (int i = 1; i <= n; i ++ ) s[i] = s[i - 1] + a[i];
    LL u = min(s[n], LL(1e6));
    for (int i = 1; i <= u; i ++ )
    {
        if (s[p] < i) p ++ ;
        t[i] = p;
    }

    while (m -- )
    {
        int b;
        cin >> b;
        if (t[b] == 0) puts("-1");
        else cout << t[b] << endl;
    }

    return 0;
}