B"This problem was copied by the author from another online platform. Codeforces strongly condemns this action and therefore further submissions to this problem are not accepted. Debajyoti has a very important meeting to attend and he is already very late. Harsh, his driver, needs to take Debajyoti to the destination for the meeting as fast as possible. Harsh needs to pick up Debajyoti from his home and take him to the destination so that Debajyoti can attend the meeting in time. A straight road with n traffic lights connects the home and the destination for the interview. The traffic lights are numbered in order from 1 to n . Each traffic light cycles after t seconds. The i -th traffic light is color{green}{ text{green}} (in which case Harsh can cross the traffic light) for the first g_i seconds, and color{red}{ text{red}} (in which case Harsh must wait for the light to turn color{green}{ text{green}} ) for the remaining (t xe2 x88 x92g_i) seconds, after which the pattern repeats. Each light's cycle repeats indefinitely and initially, the i -th light is c_i seconds into its cycle (a light with c_i=0 has just turned color{green}{ text{green}} ). In the case that Harsh arrives at a light at the same time it changes colour, he will obey the new colour. Formally, the i -th traffic light is color{green}{ text{green}} from [0,g_i) and color{red}{ text{red}} from [g_i,t) (after which it repeats the cycle). The i -th traffic light is initially at the c_i -th second of its cycle. From the i -th traffic light, exactly d_i seconds are required to travel to the next traffic light (that is to the (i+1) -th light). Debajyoti's home is located just before the first light and Debajyoti drops for the interview as soon as he passes the n -th light. In other words, no time is required to reach the first light from Debajyoti's home or to reach"...