#include <cstdio>
#include <iostream>
#define d(x) (s[x] - s[pre[x]])
using namespace std;
typedef long long LL;
typedef long double LD;
const int N = 40000001, M = 100001, MOD = 1 << 30;
const LL BASE = 1e17;
int n, type, q[N], pre[N];
int m, b[N], p[M], l[M], r[M];
LL s[N];
struct HP{
    LL x, y;
    HP(int num = 0)  {
        x = 0, y = num;
    }
    // num = x * BASE + y
    HP inline operator + (const HP b) const {
        HP c; 
        c.x = x + b.x, c.y = y + b.y;
        c.x += c.y / BASE, c.y %= BASE;
        return c;
    }
    void inline print() {
        if(x) printf("%lld%017lld\n", x, y);
        else printf("%lld\n", y);
    }
};
HP inline mul (const LL a, const LL b) {
    HP c;
    c.x = (LD)a * b / BASE;
    c.y = ((a * b - c.x * BASE) % BASE + BASE) % BASE;
    return c;
}

void inline read(int &x) {
	x = 0; char s = getchar();
	while(s > '9' || s < '0') s = getchar();
	while(s <= '9' && s >= '0') x = x * 10 + s - '0', s = getchar();
}
int main() {
	read(n); read(type);
	if(type) {
		int x, y, z; 
		read(x); read(y); read(z); read(b[1]); read(b[2]); read(m);
		for (register int i = 1; i <= m; i++) read(p[i]), read(l[i]), read(r[i]);
		for (register int i = 3; i <= n; i++) b[i] = ((LL)x * b[i - 1] + (LL)y * b[i - 2] + z) % MOD;
		for (register int i = 1; i <= m; i++)
			for (int j = p[i - 1] + 1; j <= p[i]; j++) s[j] = s[j - 1] + (b[j] % (r[i] - l[i] + 1)) + l[i];
	} else for (int i = 1, x; i <= n; i++) read(x), s[i] = s[i - 1] + x;
	int hh = 0, tt = 0;
	for (register int i = 1; i <= n; i++) {
		while(hh < tt && d(q[hh + 1]) + s[q[hh + 1]] <= s[i]) hh++;
		pre[i] = q[hh];
		while(hh <= tt && d(q[tt]) + s[q[tt]] >= d(i) + s[i]) tt--;
		q[++tt] = i;
	}
	HP ans = HP();
	for (register int i = n; i; i = pre[i]) ans = ans + mul(s[i] - s[pre[i]], s[i] - s[pre[i]]);
	ans.print();
	return 0;
}