c_b_3

#include <fstream>
#include <algorithm>
#define LL long long int
using namespace std;
ifstream f("cb3.in");
ofstream g("cb3.out");
int n,S;
LL s[10000];

int cautbin(int S)
{
    int st=0,dr=n-1,m;
    while(st<=dr)
    {
        m=st+(dr-st)/2;
        if(S<s[m])
            dr=m-1;
        else
            st=m+1;
    }
    return dr+1;
}

int main(void)
{
    int q;
    f>>n>>q;
    int v[n];
    for(int i=0;i<n;++i)
        f>>v[i];
    sort(v,v+n);
    s[0]=v[0];
    for(int i=1;i<n;++i)
        s[i]=s[i-1]+v[i];
    while(q--)
    {
        f>>S;
        g<<cautbin(S)<<'\n';
    }
    return 0;
}