import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] lreads(T = long)(long n){return generate(()=>readln.chomp.to!T()).take(n).array();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue(T, alias less = "a<b") = BinaryHeap!(Array!T, less);
// dfmt on

void main()
{
    long N = lread();
    auto C = new long[](N - 1);
    auto S = new long[](N - 1);
    auto F = new long[](N - 1);
    foreach (i; 0 .. N - 1)
    {
        scan(C[i], S[i], F[i]);
    }

    foreach (i; 0 .. N - 1)
    {
        long t;
        foreach (j; i .. N - 1)
        {
            long s = max(S[j], ((t + F[j] - 1) / F[j]) * F[j]);
            t = s + C[j];
        }
        writeln(t);
    }
    writeln(0);
}
