output_description: Print N lines. Assuming that we are at Station i (1≤i≤N) when the ceremony
  begins, if the earliest possible time we can reach Station N is x seconds
  after the ceremony begins, the i-th line should contain x.
  
  * * *
input_description: Input is given from Standard Input in the following format:
  
      
      
      N
      C_1 S_1 F_1
      :
      C_{N-1} S_{N-1} F_{N-1}
attempt: # https://atcoder.jp/contests/abc084/tasks/abc084_c
  # 制約によりたかだか500行 O(N*N)でも間に合うのでは？
  
  # 入力が10**5とかになったときに100ms程度早い
  import sys
  
  read = sys.stdin.readline
  
  
  def read_a_int():
      return int(read())
  
  
  def read_col(H, n_cols):
      """
      H is number of rows
      n_cols is number of cols
  
      A列、B列が与えられるようなとき
      """
      ret = [[] for _ in range(n_cols)]
      for _ in range(H):
          tmp = list(map(int, read().split()))
          for col in range(n_cols):
              ret[col].append(tmp[col])
  
      return ret
  
  
  N = read_a_int()
  C, S, F = read_col(N - 1, 3)
  
  
  def f(i):
      # 駅iからN-1までに向かう最短時間
      now = S[i]  # はじめは運転開始時刻
      for j in range(i, N - 2):  # 駅N-1の手前まで
          now += C[j]  # 移動時間
          # 駅の待ち時刻まで待機
          f, s = F[j + 1], S[j + 1]
          # だけど割り切れるときは余分に＋1されてしまうので-0.5してつじつま合わせ
          now_tmp = (int((now - 0.5) // f) + 1) * f
          now = max(now_tmp, s)
      now += C[N - 2]
      return now
  
  
  for i in range(N - 1):
      print(f(i))
  print(0)
  
problem_description: Statement
  
  A railroad running from west to east in Atcoder Kingdom is now complete.
  
  There are N stations on the railroad, numbered 1 through N from west to east.
  
  Tomorrow, the opening ceremony of the railroad will take place.
  
  On this railroad, for each integer i such that 1≤i≤N-1, there will be trains
  that run from Station i to Station i+1 in C_i seconds. No other trains will be
  operated.
  
  The first train from Station i to Station i+1 will depart Station i S_i
  seconds after the ceremony begins. Thereafter, there will be a train that
  departs Station i every F_i seconds.
  
  Here, it is guaranteed that F_i divides S_i.
  
  That is, for each Time t satisfying S_i≤t and t％F_i=0, there will be a train
  that departs Station i t seconds after the ceremony begins and arrives at
  Station i+1 t+C_i seconds after the ceremony begins, where A％B denotes A
  modulo B, and there will be no other trains.
  
  For each i, find the earliest possible time we can reach Station N if we are
  at Station i when the ceremony begins, ignoring the time needed to change
  trains.
samples: [{"input": "3\n    6 5 1\n    1 10 1", "output": "12\n    11\n    0\n    \n\nWe will travel from Station 1 as follows:\n\n  * 5 seconds after the beginning: take the train to Station 2.\n  * 11 seconds: arrive at Station 2.\n  * 11 seconds: take the train to Station 3.\n  * 12 seconds: arrive at Station 3.\n\nWe will travel from Station 2 as follows:\n\n  * 10 seconds: take the train to Station 3.\n  * 11 seconds: arrive at Station 3.\n\nNote that we should print 0 for Station 3.\n\n* * *"}, {"input": "4\n    12 24 6\n    52 16 4\n    99 2 2", "output": "187\n    167\n    101\n    0\n    \n\n* * *"}, {"input": "4\n    12 13 1\n    44 17 17\n    66 4096 64", "output": "4162\n    4162\n    4162\n    0"}]