#include <bits/stdc++.h>

using namespace std;

#define SZ(x) ((int)((x).size()))
#define lb(x) ((x) & (-(x)))
#define bp(x) __builtin_popcount(x)
#define bpll(x) __builtin_popcountll(x)
#define mkp make_pair
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;

void solve() {
    int n;
    cin >> n;
    vector s(n + 1, 0), a(n + 1, 0), b(n + 1, 0);
    for (int i = 1; i <= n; i++) {
        cin >> s[i] >> a[i] >> b[i];
    }

    vector kmp(n + 1, 0);
    vector fa(n + 1, map<int, int>());
    ll ans = 0, lans = 0, sum = 0;
    for (int i = 1; i <= n; i++) {
        s[i] = (s[i] + lans) % n;
        int p = kmp[i - 1];
        while (p && s[p + 1] != s[i]) {
            if (!fa[i - 1][s[p + 1]]) {
                fa[i - 1][s[p + 1]] = p;
            }
            p = kmp[p];
        }
        if (i > 1 && s[p + 1] == s[i]) {
            if (!fa[i - 1][s[p + 1]]) {
                fa[i - 1][s[p + 1]] = p;
            }
            kmp[i] = p + 1;
        }

        for (auto [x, y] : fa[p]) {
            if (!fa[i - 1][x]) {
                fa[i - 1][x] = y;
            }
        }

        for (auto [x, y] : fa[i - 1]) {
            if (x == s[i]) {
                continue;
            }
            int u = fa[i - 1][x];
            while (u) {
                sum -= b[i - u];
                u = fa[u][x];
            }
        }
        if (s[i] == s[1]) {
            sum += b[i];
        }

        ans += sum * a[i];
        lans = ans;
        cout << ans << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T = 1;
    while (T--) solve();
    return 0;
}