Statistics of Recompressing Videos

题意翻译

有一个网站叫DH，有 $n$ 个视频和 $k$ 个服务器。每个服务器可以同时压缩一个视频。多个服务器可以一起工作。 现在给定每个视频的长度 $m_i$ 和两两不等的上传时间 $s_i$（每个视频只有在上传了之后才可以压缩）输出每个视频开始压缩的时间，使得总时间最短。以 $s_i$ 单调上升给出。

题目描述

A social network for dogs called DH (DogHouse) has $ k $ special servers to recompress uploaded videos of cute cats. After each video is uploaded, it should be recompressed on one (any) of the servers, and only after that it can be saved in the social network. We know that each server takes one second to recompress a one minute fragment. Thus, any server takes $ m $ seconds to recompress a $ m $ minute video. We know the time when each of the $ n $ videos were uploaded to the network (in seconds starting from the moment all servers started working). All videos appear at different moments of time and they are recompressed in the order they appear. If some video appeared at time $ s $ , then its recompressing can start at that very moment, immediately. Some videos can await recompressing when all the servers are busy. In this case, as soon as a server is available, it immediately starts recompressing another video. The videos that await recompressing go in a queue. If by the moment the videos started being recompressed some servers are available, then any of them starts recompressing the video. For each video find the moment it stops being recompressed.

输入输出格式

输入格式

The first line of the input contains integers $ n $ and $ k $ ( $ 1<=n,k<=5·10^{5} $ ) — the number of videos and servers, respectively. Next $ n $ lines contain the descriptions of the videos as pairs of integers $ s_{i},m_{i} $ ( $ 1<=s_{i},m_{i}<=10^{9} $ ), where $ s_{i} $ is the time in seconds when the $ i $ -th video appeared and $ m_{i} $ is its duration in minutes. It is guaranteed that all the $ s_{i} $ 's are distinct and the videos are given in the chronological order of upload, that is in the order of increasing $ s_{i} $ .

输出格式

Print $ n $ numbers $ e_{1},e_{2},...,e_{n} $ , where $ e_{i} $ is the time in seconds after the servers start working, when the $ i $ -th video will be recompressed.

输入输出样例

输入样例 #1

3 2
1 5
2 5
3 5

输出样例 #1

6
7
11

输入样例 #2

6 1
1 1000000000
2 1000000000
3 1000000000
4 1000000000
5 1000000000
6 3

输出样例 #2

1000000001
2000000001
3000000001
4000000001
5000000001
5000000004