영어 원문입니다. 원문의 수식·표를 글자로 옮겨 모양이 다를 수 있습니다. 정확한 내용은 원문 페이지에서 확인하세요. 원문 페이지 열기 (새 창)
시간 제한 1초 · 메모리 제한 512 MB
Problem
There are n line segments whose endpoints have integer coordinates. The left x-coordinate of each segment is 0 and the right x-coordinate is m. The slope of each segment is an integer.
For each x-coordinate 0,1,…,m, find the maximum point in any line segment.
Input
The first line has two integers n and m: the number of line segments and the maximum x-coordinate.
The next n lines describe the line segments. Each line has two integers y_1 and y_2: there is a line segment between points (0,y_1) and (m,y_2).
Output
Print m+1 integers: the maximum points for x=0,1,…,m.
Constraints
- 1 ≤ n, m ≤ 10^5
- 0 ≤ y_1,y_2 ≤ 10^9
예제
예제 1
4 5 1 6 7 2 5 5 10 0
10 8 6 5 5 6