#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;


int n, m;

int bins(vector<int> v, int t)
{
    t = t % v.back();
    int b = 1;
    int j = n;
    int k;
    while (b <= j)
    {
        k = (b + j) / 2;
        if (v[k] == t)
            return k;
        else if (v[k] > t)
            j = k - 1;
        else
            b = k + 1;
    }
    return b;
}

int main()
{
    cin >> n >> m;
    int a;
    vector<int> v;
    v.push_back(0);
    for (int i = 1; i <= n; ++i)
    {
        cin >> a;
        v.push_back(v.back() + a);
    }
    for (int i = 1; i <= m; ++i)
    {
        cin >> a;
        cout << binary_search(v.begin(), v.end(), a) + 1 << " ";
    }
}