#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<int, int> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 3e5 + 5;
ll n, s[N], a[N], b[N], nxt[N], pre[N], t[N];
int main(){
    read(n);
    ll lst = 0, ans = 0, tot = 0;
    int j = 0, x = 0;
    _rep(i, 1, n){
        read(s[i], a[i], b[i]);
        s[i] = (s[i] + lst % n) % n;
        // debug("%d ", s[i]);
        if(i > 1){
            while(j && s[j + 1] != s[i]) j = nxt[j];
            if(s[j + 1] == s[i]) j++;
            nxt[i] = j;
            t[i - 1] = s[i];
            if(t[i - 1] == t[nxt[i - 1]]) pre[i - 1] = pre[nxt[i - 1]];
            else pre[i - 1] = nxt[i - 1];
        }
        if(x){
            int t = i - x, y = 0;
            while(t){
                if(s[t + 1] != s[i]){
                    tot -= b[i - t];
                    t = nxt[t];
                }else{
                    if(!y) y = t;
                    t = pre[t];
                }
            }
            x = i - y;
        }
        if(s[i] == s[1]){
            if(!x && i > 1) x = i;
            tot += b[i];
        }else if(x == i) x = 0;
        ans += a[i] * tot;
        // debug("i:%d x:%d tot:%d\n", i, x, tot);
        writeln(lst = ans);
    } 
    return 0;
}