#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
int n, a[N], tree[N], m;

struct node {
	int sum, id;
} p[N];

int lobit(int x) {
	return x & -x;
}

void update(int x, int c) {
	for (int i = x; i <= n; i += lobit(i)) {
		tree[i] += c;
	}
}

int query(int x) {
	int res = 0;
	for (int i = x; i >= 1; i -= lobit(i)) {
		res += tree[i];
	}
	return res;
}

bool cmp(node a, node b) {
	if (a.sum == b.sum) {
		return a.id > b.id;
	} else
		return a.sum < b.sum;
}

int main() {
	cin >> n >> m;
	n++;
	a[1] = 0;
	for (int i = 2; i <= n; i++) {
		cin >> a[i];
	}
	for (int i = 1; i <= n; i++) {
		p[i].sum = p[i - 1].sum + a[i] - m;
		p[i].id = i;
	}
	sort(p + 1, p + n + 1, cmp);
	int res = 0, Mod = 92084931;
	for (int i = 1; i <= n; i++) {
		res += query(p[i].id);
		res %= Mod;
		update(p[i].id, 1);
	}
	cout << res << endl;
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 5;
int n, m, a[4 * N], b[4 * N], c[4 * N];

int main() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		int v, x;
		cin >> v >> x;
		c[x - 3 * v + 1 + N]++;
		c[x - 2 * v + 1 + N] -= 2;
		c[x + 1 + N] += 2;
		c[x + 2 * v + 1 + N] -= 2;
		c[x + 3 * v + 1 + N]++;
	}
	for (int i = 1; i <= m + N; i++) {
		c[i] += c[i - 1];
		b[i] = b[i - 1] + c[i];
	}
	for (int i = N + 1; i <= N + m ; i++) {
		cout << b[i] << " ";
	}
	return 0;
}

/*
1 2 3 4 5
4 7 10 13 16

a 4 7 10 13 16 0 0
b 4 3 3  3  3  -16 0
c 4 -1 0 0  0  -19 16
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e7 + 5;
int n, m, a[N], b[N], c[N];
signed main() {
	cin >> n >> m;
	for (int i = 1; i <= m; i++) {
		int l, r, s, e;
		cin >> l >> r >> s >> e;
		int d = (e - s) / (r - l);
		c[l] += s;
		c[l + 1] += d - s;
		c[r + 1] -= e + d;
		c[r + 2] += e;
	}
	int res1 = 0, res2 = 0;
	for (int i = 1; i <= n; i++) {
		c[i] += c[i - 1];
		b[i] = b[i - 1] + c[i];
		res1 ^= b[i];
		res2 = max(res2, b[i]);
	}
	cout << res1 << " " << res2 << endl;
	return 0;
}