시간 제한메모리 제한제출정답맞힌 사람정답 비율
1.5 초 (추가 시간 없음) 512 MB76685.714%

## 문제

The COVID-19 pandemic took the world by surprise in many ways. Almost overnight, people around the globe had to adapt to a new way of life, mainly shaped by the preventive measures issued by their local authorities, all with the goal of suppressing and controlling the spread of the disease.

To better prepare for the unlikely event of a more devastating outbreak in the far future, the Croatian National Institute of Public Health decided to open various research departments. The main goal of these departments is to develop highly efficient protocols that help the general population to quickly adhere to a new preventive measure.

Alenka works in one such department, and is currently investigating the scenario in which a group of people stands in a line, e.g. in front of a post office, and suddenly a new safety measure takes place, mandating that distance between any two people has to be at least $D$.

She also implemented an app that allows the user to specify a distance $D$ and locations of $N$ people as coordinates along a line. The app then draws a picture of a line which represents the situation, and calculates the smallest amount of time in seconds, denoted as $t_{opt}$, needed for the group to reach a new arrangement that satisfies the preventive measure. The app assumes that people are going to immediately start rearranging themselves optimally, and that all people move with the same constant speed of one unit per second.

She now wants to add a new feature that will enable the user to add $M$ additional people to the group by tapping on the drawn line, thereby specifying their locations. The app is supposed to recalculate $t_{opt}$ after each tap, i.e. after each new person is added to the group.

## 입력

The first line contains integers $N$, $M$, and $D$ from the task description.

The second line contains $N$ integers $a_1, \dots , a_N$, the locations of the $N$ initial people.

The third line contains $M$ integers $b_1, \dots , b_M$, the locations of the $M$ additional people.

## 출력

Output $M$ numbers in one line, the $i$-th of them representing the value of $t_{opt}$ given that the group consists of $(N + i)$ people at locations $a_1, a_2, \dots , a_N , b_1, \dots , b_i$.

Output each number in decimal notation without trailing zeroes, e.g. output 1.23 instead of 1.2300, and 123 instead of 123. or 123.0. It can be proven that answers always have a finite decimal representation..

## 제한

In all subtasks it holds that $1 ≤ D, a_1, \dots , a_N , b_1, \dots , b_M ≤ 10^9$.

## 서브태스크

번호배점제한
110

$0 ≤ N ≤ 2\,000$, $1 ≤ M ≤ 10$

214

$0 ≤ N ≤ 200\,000$, $1 ≤ M ≤ 10$

335

$N = 0$, $1 ≤ M ≤ 200\,000$, $b_1 ≤ \dots ≤ b_M$

441

$N = 0$, $1 ≤ M ≤ 200\,000$

## 예제 입력 1

2 1 2
1 3
2


## 예제 출력 1

1


## 예제 입력 2

0 5 3

1 2 3 4 5


## 예제 출력 2

0 1 2 3 4


## 예제 입력 3

3 3 3
3 3 3
3 3 3


## 예제 출력 3

4.5 6 7.5


## 채점 및 기타 정보

• 예제는 채점하지 않는다.