using System;
using System.Collections;
using System.Collections.Generic;
using System.Collections.Specialized;
using System.Linq;
using System.Numerics;

namespace AtCoderWorkspace
{
    public class Solver
    {
        public void Solve()
        {
            var cin = new Scanner();
            var n = cin.nextInt();
            var list = new List<Station>();
            for (int i = 0; i < n-1; i++)
            {
                list.Add(new Station
                {
                    Cost = cin.nextLong(),
                    Start = cin.nextLong(),
                    Freq = cin.nextLong()
                });
            }

            var alist = new List<long>();
            for (int i = 0; i < n-1; i++)
            {
                var time = 0L;
                for (int j = i; j < n-1; j++)
                {
                    var cost = list[j].Cost;
                    var start = list[j].Start;
                    var freq = list[j].Freq;

                    // start wait
                    if(time < start)
                    {
                        time = start;
                    }
                    else if(time % freq == 0)
                    {

                    }
                    else
                    {
                        time = (time + freq) - (time % freq);
                    }
                    time += cost;
                }
                alist.Add(time);
            }
            alist.Add(0);

            foreach (var item in alist)
            {
                Console.WriteLine(item);
            }            
        }
        private class Station
        {
            public long Cost { get; set; }
            public long Start { get; set; }
            public long Freq { get; set; }
        }
    }

    class Scanner
    {
        string[] s;
        int i;

        char[] cs = new char[] { ' ' };

        public Scanner()
        {
            s = new string[0];
            i = 0;
        }

        public string next()
        {
            if (i < s.Length) return s[i++];
            string st = Console.ReadLine();
            while (st == "") st = Console.ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            if (s.Length == 0) return next();
            i = 0;
            return s[i++];
        }

        public int nextInt()
        {
            return int.Parse(next());
        }
        public int[] ArrayInt(int N, int add = 0)
        {
            int[] Array = new int[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt() + add;
            }
            return Array;
        }

        public int[] DPArrayInt(int N, int ex)
        {
            int[] Array = new int[N+ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextInt();
            }
            return Array;
        }

        public long nextLong()
        {
            return long.Parse(next());
        }

        public long[] ArrayLong(int N, long add = 0)
        {
            long[] Array = new long[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong() + add;
            }
            return Array;
        }

        public long[] DPArrayLong(int N, int ex)
        {
            long[] Array = new long[N + ex];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextLong();
            }
            return Array;
        }

        public double nextDouble()
        {
            return double.Parse(next());
        }


        public double[] ArrayDouble(int N, double add = 0)
        {
            double[] Array = new double[N];
            for (int i = 0; i < N; i++)
            {
                Array[i] = nextDouble() + add;
            }
            return Array;
        }
    }   

    class Program
    {
        static void Main(string[] s) => new Solver().Solve();
    }
}


Measured memory_bytes: 13268