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

using namespace std;

int main(){
    int n, m;
    cin>>n;
    cin>>m;
    int* speeds = new int[n];
    int* areal = new int[n];
    int* days = new int[m+1];
    int* blades = new int[m];
    for(int i = 0; i < n; i++){
        cin>>speeds[i];
        areal[i]=0;
    }
    days[0] = 0;
    for(int i = 0; i < m; i++){
        cin>>days[i];
        cin>>blades[i];
    }
    
    for(int d = 0; d<m; d++){
        int total = 0;
        for(int i = 0; i < n; i++){
            total += max(areal[i]+(days[d+1]-days[d])*speeds[i]-blades[d],0);
            areal[i] = min(areal[i]+(days[d+1]-days[d])*speeds[i], blades[d]);
        }
        cout << total << endl;
    }
    
    return 0;
}