hackathon: "yanko war" de 70

#include <bits/stdc++.h>
using namespace std;
#define int long long

signed main() {
    int n, q;
    cin >> n >> q;
    vector<int> hp(n);
    for (int &nr : hp) {
        cin >> nr;
    }

    for (int currPos = 0; q--;) {
        int damage;
        cin >> damage;

        while (damage >= hp[currPos] && currPos < n) {
            damage -= hp[currPos];
            currPos++;
        }

        int ans = n - currPos;
        cout << (ans ? ans : n) << endl;

        currPos %= n;
    }
    return 0;
}