31726번 - Fish 3 서브태스크다국어

문제

JOI-kun is breeding $N$ fish in a large tank, and each fish is numbered from 1ドル$ to $N$.

JOI-kun has two types of fish food, A and B, both in sufficient quantities. When one piece of food is added to the aquarium, exactly one fish eats it (any fish could potentially eat it), and depending on the type of food and which fish ate it, the intelligence of the fish changes as follows:

• When fish $k$ (1ドル ≤ k ≤ N$) eats one piece of type A food, the intelligence of fish $k$ increases exactly by $D$.
• When fish $k$ (1ドル ≤ k ≤ N$) eats one piece of type B food, the intelligence of all fish numbered $k$ and above increases exactly by 1ドル$ each.

Currently, the intelligence of all fish is 0ドル$. JOI-kun wants to make the intelligence of fish $i$ (1ドル ≤ i ≤ N$) equal to its ideal intelligence $C_i,ドル but it may not always be possible.

Therefore, he considered $Q$ questions. The $j$-th question (1ドル ≤ j ≤ Q$) is as follows:

• Starting from the state where all fish have an intelligence of 0ドル,ドル by repeating the action of putting food into the aquarium zero or more times, is it possible to reach the state where all fish $L_j , L_j + 1, \dots , R_j$ have their exact ideal intelligence values? Furthermore, if it is possible, what is the minimum number of pieces of type A food that needs to be put into the tank?

Write a program that, given information about JOI-kun’s fish and information about the questions, answers his questions.

입력

Read the following data from the standard input.

$N$ $D$

$C_1$ $C_2$ $\cdots$ $C_N$

$Q$

$L_1$ $R_1$

$L_2$ $R_2$

$\vdots$

$L_Q$ $R_Q$

출력

Write $Q$ lines to the standard input. In the $j$-th line (1ドル ≤ j ≤ Q$), if it is possible to reach the state where all fish $L_j , L_j + 1, \dots , R_j$ have their exact ideal intelligence values, output the minimum number of pieces of type A food that needs to be put into the tank. Otherwise, output -1.

제한

• 1ドル ≤ N ≤ 300,円 000$.
• 1ドル ≤ Q ≤ 300,円 000$.
• 1ドル ≤ D ≤ 10^{12}$.
• 0ドル ≤ C_i ≤ 10^{12}$ (1ドル ≤ i ≤ N$).
• 1ドル ≤ L_j ≤ R_j ≤ N$ (1ドル ≤ j ≤ Q$).
• Given values are all integers.

서브태스크

힌트

첨부

• fish3.zip