#include <bits/stdc++.h>

using LL = long long;

signed main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n;
    std::cin >> n;

    LL ans = 0, sumB = 0;
    std::vector<LL> s(n), f(n + 1), a(n), b(n);

    std::cin >> s[0] >> a[0] >> b[0];

    sumB += b[0];
    ans += a[0] * b[0];
    std::cout << ans << '\n';

    std::vector<int> fa(n + 1);
    std::iota(fa.begin(), fa.end(), 0);
    auto find = [&](int x) {
        while (x != fa[x]) x = fa[x] = fa[fa[x]];
        return x;
    };

    for (int i = 1, j = 0; i < n; i++) {

    	std::cin >> s[i] >> a[i] >> b[i];
    	s[i] = (s[i] + ans) % n;

        int t = j;
        while (t) {
            if (s[t] != s[i]) {
                sumB -= b[i - t];
            } else if (s[t] == s[f[t]]) {
                fa[t] = find(f[t]);
                t = fa[t];
            }
            t = f[t];
        }

        // kmp
        while (j && s[i] != s[j]) {
            j = f[j];
        }

        j += (s[i] == s[j]);
        f[i + 1] = j;

        // get ans
        if (s[i] == s[0]) {
            sumB += b[i];
        }
        ans += a[i] * sumB;

        std::cout << ans << '\n';

    }

    return 0;
}