#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

const ll mod = 1 << 30;

int n, type;
ll a[40000010];
int ia[40000010];
struct node {
    ll g;
    int id;
} stk[40000010];

void print(__int128 x) {
    if (x >= 10) print(x / 10);
    putchar(x % 10 + '0');
}

ll read() {
    ll x = 0;
    char c = getchar();
    
    while (c < '0' || c > '9') c = getchar();
    while (c >= '0' && c <= '9') x = x * 10ll + c - '0', c = getchar();

    return x;
}

int main() {
    scanf("%d%d", &n, &type);

    if (type == 0) {
        for (int i = 1; i <= n; ++i) a[i] = read();
        for (int i = 1; i <= n; ++i) a[i] += a[i - 1];
        
        int tt = 0;
        stk[++tt] = {0, 0};
        int la = 1;

        for (int i = 1; i <= n; ++i) {
            // cout << stk[la + 1].g + a[stk[la + 1].id] << ' ' << a[i] << endl;
            la = min(la, tt);
            while (la + 1 <= tt && stk[la + 1].g + a[stk[la + 1].id] <= a[i]) ++la;
            int l = la;
            ll g = (a[i] - a[stk[l].id]);
            // cout << stk[l].id << ' ' << l << endl;
            // cout << la << ' ' << g << ' ' << l << ' ' << a[i] << endl;
            ia[i] = stk[l].id;

            while (g + a[i] <= stk[tt].g + a[stk[tt].id]) --tt;
            stk[++tt] = {g, i};
        }

        __int128 ans = 0;
        int id = n;
        while (id) {
            // cout << id << ' ' << ia[id] << endl;
            ans += (__int128)(a[id] - a[ia[id]]) * (a[id] - a[ia[id]]);
            id = ia[id];
        }

        print(ans);
    } else {
        ll x = read(), y = read(), z = read(); a[1] = read(), a[2] = read(); ll m = read();
        for (int i = 1; i <= m; ++i) ia[i] = read(), stk[i].g = read(), stk[i].id = read();
        for (int i = 3; i <= n; ++i) a[i] = (a[i - 1] * x + a[i - 2] * y + z) % mod;
        
        for (int i = 1; i <= m; ++i) {
            int len = stk[i].id - stk[i].g + 1;
            for (int j = ia[i - 1] + 1; j <= ia[i]; ++j) {
                a[j] = (a[j] - a[j] / len * len) + stk[i].g; 
            }
        }
        
        for (int i = 1; i <= n; ++i) a[i] += a[i - 1];
        
        int tt = 0;
        stk[++tt] = {0, 0};
        int la = 1;

        for (int i = 1; i <= n; ++i) {
            // cout << stk[la + 1].g + a[stk[la + 1].id] << ' ' << a[i] << endl;
            la = min(la, tt);
            while (la + 1 <= tt && stk[la + 1].g + a[stk[la + 1].id] <= a[i]) ++la;
            int l = la;
            ll g = (a[i] - a[stk[l].id]);
            // cout << stk[l].id << ' ' << l << endl;
            // cout << la << ' ' << g << ' ' << l << ' ' << a[i] << endl;
            ia[i] = stk[l].id;

            while (g + a[i] <= stk[tt].g + a[stk[tt].id]) --tt;
            stk[++tt] = {g, i};
        }

        __int128 ans = 0;
        int id = n;
        while (id) {
            // cout << id << ' ' << ia[id] << endl;
            ans += (__int128)(a[id] - a[ia[id]]) * (a[id] - a[ia[id]]);
            id = ia[id];
        }

        print(ans);
    }

    return 0;
}