#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/priority_queue.hpp>
#include <ext/rope>
using namespace std;
using namespace __gnu_pbds;
using namespace __gnu_cxx;
#define int long long
using ll = long long;
mt19937_64 rd(time(0));
template <class K, class C = less<>> using paring_heap = __gnu_pbds::priority_queue<K, C>;
template <class K, class V = null_type, class C = less<>> using rb_tree = tree<K, V, C, rb_tree_tag, tree_order_statistics_node_update>;
template <class T, class ... A> void debug(const T & t, const A & ... a) { cerr << "[" << t, ((cerr << ", " << a), ...), cerr << "]\n"; }
const ll mod = [](bool n) { return n ? 998244353 : 1e9 + 7; } (1);

template <ll mod = mod> ll binpow(ll a, ll b, ll res = 1) {
    for (a %= mod; b; b >>= 1, (a *= a) %= mod) {
        if (b & 1) (res *= a) %= mod;
    }
    return res;
}

vector<int> inv, fact, invfa;
auto INIT_FACT = ([](int n) {
    inv = fact = invfa = vector<int>(n + 1, 1);
    for (int i = 2; i <= n; i++) {
        fact[i] = (ll)fact[i - 1] * i % mod, invfa[i] = (ll)invfa[i - 1] * (inv[i] = (mod - mod / i) * inv[mod % i] % mod);
    }
} (0), true);
ll C(int n, int m) { return min(n - m, m) < 0 ? 0 : (ll)fact[n] * invfa[m] % mod * invfa[n - m] % mod; }
ll P(int n, int m) { return min(n - m, m) < 0 ? 0 : (ll)fact[n] * invfa[n - m] % mod; }
ll LC(ll n, ll m) { return !m ? 1 : C(n % mod, m % mod) * LC(n / mod, m / mod) % mod; }

struct KMP : vector<int> {  // 数组表示 S[:i] 最长真前缀和真后缀的长度
    vector<int> uni;    
    KMP(const string & s = {}) : vector(s.size()), uni(s.size()) { // 从 0 开始，前缀函数
        for (int i = 1; i < size(); at(i++) += s[i] == s[at(i)]) {
            for (at(i) = at(i - 1); at(i) && s[i] != s[at(i)]; at(i) = at(at(i) - 1));
        }
    }
    KMP(const string & t, const string & s, char o = '#') : KMP(t + o + s) {}

    void Dy_ZFun(const string & s, int i) { // i 从 [0, n - 1] 都要
        static vector<int> uni; // 跳到下个 kmp[i] != kmp[kmp[i] - 1] 不同字母的位置
        if (!i) emplace_back(0), uni.emplace_back(0);
        else {
            // for (at(i) = at(i - 1); at(i) && s[i] != s[at(i)]; at(i) = at(at(i) - 1));
            // uni[i] = at(i) += s[i] == s[at(i)];
            // if (at(i) >= 1) uni[i] = s[at(i)] != s[at(at(i) - 1)] ? at(at(i) - 1) : uni[at(i) - 1];
            // for (int k = at(i - 1); k; k = s[i] == s[at(k - 1)] ? uni[k - 1] : kmp[k - 1]) 
        }
    }
};

void QAQ() {
    int n;
    cin >> n;

    vector<int> s(n), a(n), b(n), pre(n + 1), kmp(n), uni(n);

    int ans = 0, cnt = 0;

    for (int i = 0; i < n; i++) {
        cin >> s[i] >> a[i] >> b[i];
        (s[i] += ans) %= n, pre[i + 1] = pre[i] + a[i], cnt += b[i];

        int unable = 0;

        if (i > 0) {
            for (kmp[i] = kmp[i - 1]; kmp[i] && s[i] != s[kmp[i]]; kmp[i] = kmp[kmp[i] - 1]);
            uni[i] = kmp[i] += s[i] == s[kmp[i]];
            if (kmp[i] >= 1) uni[i] = s[kmp[i]] != s[kmp[kmp[i] - 1]] ? kmp[kmp[i] - 1] : uni[kmp[i] - 1];

            for (int k = kmp[i - 1]; k; ) {
                if (s[i] != s[k]) {
                    unable += b[i - k];
                }
                if (s[i] == s[kmp[k - 1]]) k = uni[k - 1];
                else k = kmp[k - 1];
            }
            if (s[i] != s[0]) {
                unable += b[i];
            }
        }

        cnt -= unable;
        ans += cnt * a[i];

        cout << ans << "\n";
    }
}

signed main() {
    cin.tie(0) -> sync_with_stdio(0);
    int t = 1;
    // cin >> t;
    for (cout << fixed << setprecision(12); t--; QAQ());
}