#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mid (l+r>>1)
const int N = 2e5 + 7;
int a[N], sum[N << 2], add[N << 2], m, op, l, r, n, g;
int w;
inline int read() {
	int x = 0, f = 1;
	char ch = getchar();
	for (; !isdigit(ch); ch = getchar()) if (ch == '-') f = -1;
	for (; isdigit(ch); ch = getchar()) x = x * 10 + ch - '0';
	return x * f;
}
inline void maketree(int k, int l, int r) {
	if (l == r) {
		sum[k] = a[r];
		return;
	}
	maketree(k << 1, l, mid), maketree(k << 1 | 1, mid + 1, r);
	sum[k] = sum[k << 1] + sum[k << 1 | 1];
	return;
}
inline void Add(int k, int l, int r, int v) {
	add[k] += v, sum[k] += (r - l + 1) * v;
}
inline void pushdown(int k, int l, int r) {
	if (!add[k]) return;
	Add(k << 1, l, mid, add[k]), Add(k << 1 | 1, mid + 1, r, add[k]);
	add[k] = 0;
}
inline void modifly(int k, int l, int r, int x, int y, int v) {
	if (l >= x && r <= y) {
		Add(k, l, r, v);
		return;
	}
	pushdown(k, l, r);
	if (x <= mid) modifly(k << 1, l, mid, x, y, v);
	if (mid < y)  modifly(k << 1 | 1, mid + 1, r, x, y, v);
	sum[k] = sum[k << 1] + sum[k << 1 | 1];
}
inline int query(int k, int l, int r, int y) {
	if (l == r) return l;
	pushdown(k, l, r);
	if (sum[k << 1] * (1ll << (g - 1)) >= y) return query(k << 1, l, mid, y);
	return query(k << 1 | 1, mid + 1, r, y - sum[k << 1 | 1] * (1ll << (g - 1)));
}
main() {
	n = read(), m = read(), w = read();
	for (int i = 1; i <= n; i++) a[i] = read();
	maketree(1, 1, n);
	while (m--) {
		l = read(), r = read(), op = read();
		modifly(1, 1, n, l, r, op);
		int k = 2, d = sum[1];
		g = 0;
		for (g = 1;; g++) {
			if (d * (k - 1) >= w)break;
			k = k << 1;
		}
		int res = w - d * (k / 2 - 1);
		cout << query(1, 1, n, res) + (g - 1)*n - 1 << endl;
	}
	return 0;
}