#include <iostream>
#include <set>
#include <vector>
using namespace std;
using ll = long long;

int main() {
    cin.tie(0), cout.tie(0), ios::sync_with_stdio(0);
    int n;
    cin >> n;
    ll ans = 0;
    int b0;
    ll sum = 0;
    vector<int> s;
    s.reserve(n);
    vector<int> b(n);
    vector<vector<int>> kill(n + 1);
    // deal with the first;
    {
        int s1, a;
        cin >> s1 >> a >> b0;
        s.push_back(s1);
        ans += a * b0;
        cout << ans << '\n';
    }

    vector<int> alive(n);

    int first = -1;
    for (int i = 1; i < n; ++i) {
        int s1, a;
        cin >> s1 >> a >> b[i];
        s1 = (s1 + ans) % n;
        ans += b0 * a;
        s.push_back(s1);
        if (s1 == s[0]) {
            alive[i] = 1;
            if (first == -1) first = i;
            sum += b[i];
        }
        // cout << first << "qwq" << endl;

        while (first != -1 && s1 != s[i - first]) {
            kill[i].push_back(first);
            sum -= b[first];
            alive[first] = 0;
            for (; first <= i && alive[first] == 0; first++);
            if (first > i) first = -1;
        }

        if (first != -1) {
            int offset = first;
            for (auto to_kill : kill[i - offset]) {
                kill[i].push_back(to_kill + offset);
                sum -= b[to_kill + offset];
                alive[to_kill + offset] = 0;
            }
        }
        ans += sum * a;
        cout << ans << '\n';
    }
}
/*
3
0 1 2
1 2 3
2 3 4


*/