#include<cstdio>
#define maxn 300005
#define ll long long
using namespace std;

int n;
int fail[maxn],sum[maxn];
ll mod,lastans=0,totb,a[maxn],b[maxn],s[maxn];

void solve(int n)
{
	scanf("%lld%lld%lld",&s[n],&a[n],&b[n]);
	s[n]=(s[n]+lastans)%mod;
	if(n==0)
	fail[n+1]=0;
	else
	{
		int t=fail[n];
		while(t&&s[t]!=s[n])
		t=fail[t];
		fail[n+1]=((s[t]==s[n])?t+1:0);
	}
	if(fail[n+1]!=0)
	sum[n]=sum[fail[n+1]-1]+1;
	else sum[n]=1;
	if(n>=1&&sum[n]!=sum[n-1]+1)
	{
		totb=0;
		int t=n+1;
		while(t)
		{
			int len=n-t+1;
			totb+=b[len];
			t=fail[t];
		}
	}
	else totb+=b[n];
	lastans+=totb*a[n];
	printf("%lld\n",lastans);
}

int main()
{
	fail[0]=0;
	scanf("%d",&n);
	mod=n;
	for(int i=0;i<n;++i)
	solve(i);
	return 0;
}