// 一个断点只会被找到1次 
// 在boarder树上建出主席树 
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 3e5 + 10;
LL a[N], b[N];
int root[N], tot;
int n, S[N], dep[N];
int nxt[N];
struct SegmentTree {
	int ls, rs, mx;
	#define ls(x) t[x].ls
	#define rs(x) t[x].rs
	#define mx(x) t[x].mx
}t[N * 20];
int build() {
	tot ++;
	return tot;
}
void update(int p) {mx(p) = max(mx(ls(p)), mx(rs(p)));}
int ins(int p, int lp, int rp, int pos, int c) { 
    int tp = build(); t[tp] = t[p];
 	if(lp == rp) {
		mx(tp) = max(mx(tp), c);
		return tp;
	}
	int mid = (lp + rp >> 1);
	if(pos <= mid) ls(tp) = ins(ls(tp), lp, mid, pos, c);
	else rs(tp) = ins(rs(tp), mid + 1, rp, pos, c);
	update(tp);
	return tp;
}
int ask(int p, int lp, int rp, int l, int r) {
	if(l > r) return 0;
	if(l <= lp && r >= rp) return mx(p);
	int mid = (lp + rp >> 1);
	if(r <= mid) return ask(ls(p), lp, mid, l, r);
	else if(l > mid) return ask(rs(p), mid + 1, rp, l, r);
	else return max(ask(ls(p), lp, mid, l, r), ask(rs(p), mid + 1, rp, l, r));
}
int main() {
	scanf("%d", &n);
	LL lstans = 0; LL Sum = 0;
	int j = 0; 
	for(int i = 1; i <= n; i ++ ) {
		scanf("%d%lld%lld", &S[i], &a[i], &b[i]);
		S[i] = (S[i] + lstans) % n;
		if(i == 1) nxt[i] = 0;
		else {
			while(j && S[j + 1] != S[i]) j = nxt[j];
			if(S[j + 1] == S[i]) j ++;
			nxt[i] = j;
		} // 考虑 i 接上 nxt[i] 
		root[i] = ins(root[nxt[i]], 0, n, S[nxt[i] + 1], nxt[i]); 
		if(S[i] == S[1]) Sum += b[i];
		int now = i - 1;
		int l = max(ask(root[now], 0, n, 0, S[i] - 1), ask(root[now], 0, n, S[i] + 1, n));
		while(l > 0) {
			Sum -= b[i - l];
			now = l;
			l = max(ask(root[now], 0, n, 0, S[i] - 1), ask(root[now], 0, n, S[i] + 1, n));
		} 
		lstans += Sum * a[i];
		printf("%lld\n", lstans);
	}
	return 0;
}
/*
3
0 1 2
1 2 3
2 3 4
*/