Output $n+1$ lines, where the i$i$-th line will contain the shortest possible waiting time after i−1$ i - 1$ changes (the first one should correspond to the situation before any changes).

-> 

Output $k+1$ lines 여야합니다