#include <bits/stdc++.h>
using namespace std;
typedef long long i64; 
const i64 INF = 2e18; 

int n, m, K; 
struct Node {
    int p, d; 
    bool operator< (const Node &a) const {
        return p < a.p; 
    }
} a[200005];
i64 dis[200005]; 

namespace ST {
    int lg[200005]; i64 f[18][200005], g[18][200005]; 
    i64 query(int op, int l, int r) {
        l = max(1, l); r = min(r, n); 
        Node tmp = {l, 0}; l = lower_bound(a + 1, a + K + 1, tmp) - a; 
        tmp = {r, 0}; r = upper_bound(a + 1, a + K + 1, tmp) - (a + 1);  
        if (l > r) return INF; 
        int k = lg[r - l + 1]; 
        if (op == 1) return min(f[k][l], f[k][r - (1 << k) + 1]); 
        return min(g[k][l], g[k][r - (1 << k) + 1]); 
    }
    void init(void) {
        for (int i = 2; i <= K; ++i) lg[i] = lg[i >> 1] + 1; 
        for (int i = 1; i <= K; ++i) 
            f[0][i] = a[i].d - dis[a[i].p], // 
            g[0][i] = a[i].d + dis[a[i].p]; // 
        for (int i = 1; i <= lg[K]; ++i)
            for (int j = 1; j + (1 << i) - 1 <= K; ++j)
                f[i][j] = min(f[i - 1][j], f[i - 1][j + (1 << i - 1)]), 
                g[i][j] = min(g[i - 1][j], g[i - 1][j + (1 << i - 1)]); 
    }
}
using namespace ST; 

bool checkl(int p, int x) { // p 更新到 x，x < p
    if (p == x) return 1; int d = abs(p - x); 
    i64 t1 = query(1, x - d, x) + dis[x];
    i64 t2 = query(2, x, x + d - 1) - dis[x]; 
    i64 now = query(2, p, p) - dis[x]; 
    return t1 > now && t2 > now; 
}
int calcl(int p) {
    int L = 0, R = p + 1;
    while (L + 1 != R) {
        int mid = L + R >> 1; 
        if (checkl(p, mid)) R = mid; 
        else L = mid; 
    }
    return R; 
}

bool checkr(int p, int x) { // 从 p 能否更新到 x，x > p
    if (p == x) return 1; int d = abs(p - x); 
    i64 t1 = query(1, x - d + 1, x) + dis[x]; 
    i64 t2 = query(2, x, x + d - 1) - dis[x]; // x + x - p - 1
    i64 now = query(1, p, p) + dis[x]; 
    if (t1 <= now || t2 <= now) return 0; 
    if (x + d <= n) return query(2, x + d, x + d) - dis[x] >= now; // 如果此时
    return 1; 
}
int calcr(int p) {
    int L = p - 1, R = n + 1; 
    while (L + 1 != R) {
        int mid = L + R >> 1; 
        if (checkr(p, mid)) L = mid; 
        else R = mid; 
    }
    return L; 
}

int main(void) {
    scanf("%d%d", &n, &m); 
    for (int i = 2; i <= n; ++i) scanf("%lld", dis + i), dis[i] += dis[i - 1]; 
    while (m--) {
        scanf("%d", &K); 
        for (int i = 1; i <= K; ++i) scanf("%d%d", &a[i].p, &a[i].d); 
        sort(a + 1, a + K + 1); ST::init(); 
        
        i64 ans = 0; 
        for (int i = 1; i <= K; ++i) ans += (calcr(a[i].p) - calcl(a[i].p) + 1); 
        printf("%lld\n", ans); 
    }
    return 0; 
}