#include <bits/stdc++.h>
using namespace std;
 
int main()
{
    int n,q;  // size of array n and no of queries q.
    cin>>n>>q;
    vector<int> arr(n+1,0);   //using 1 based indexing 
    vector<int> dp(n+1);    // creating a dp array to store sum till i from 1
    for(int i=1;i<=n;i++)
    {
        cin>>arr[i];
        dp[i]=dp[i-1]+arr[i];
    }
    for(int i=0;i<q;i++)
    {
        int query;
        cin>>query;
        cout<<dp[query]<<endl;
    }
 
 
    return 0;
}

I2luY2x1ZGUgPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CgppbnQgbWFpbigpCnsKICAgIGludCBuLHE7ICAvLyBzaXplIG9mIGFycmF5IG4gYW5kIG5vIG9mIHF1ZXJpZXMgcS4KICAgIGNpbj4+bj4+cTsKICAgIHZlY3RvcjxpbnQ+IGFycihuKzEsMCk7ICAgLy91c2luZyAxIGJhc2VkIGluZGV4aW5nIAogICAgdmVjdG9yPGludD4gZHAobisxKTsgICAgLy8gY3JlYXRpbmcgYSBkcCBhcnJheSB0byBzdG9yZSBzdW0gdGlsbCBpIGZyb20gMQogICAgZm9yKGludCBpPTE7aTw9bjtpKyspCiAgICB7CiAgICAgICAgY2luPj5hcnJbaV07CiAgICAgICAgZHBbaV09ZHBbaS0xXSthcnJbaV07CiAgICB9CiAgICBmb3IoaW50IGk9MDtpPHE7aSsrKQogICAgewogICAgICAgIGludCBxdWVyeTsKICAgICAgICBjaW4+PnF1ZXJ5OwogICAgICAgIGNvdXQ8PGRwW3F1ZXJ5XTw8ZW5kbDsKICAgIH0KICAgIAoKICAgIHJldHVybiAwOwp9