Little Lana and little Fran are visiting a chocolate factory. They have seen how
chocolate is made, tasted many chocolates, and now they want to buy some of the
chocolates.
In the shop, there are \(n\) different chocolates, and the \(i-th\) of them has the price
\(c@@RISE_MATH_BLOCK_0@@i - k\)
kunas.
Let’s denote \(l\) as the amount Lana has to pay, and \(f\) as the amount Fran has to pay. Lana, dissatisfied
with Fran’s deal, wants to spite Fran and choose the chocolates so the value of the expression \(l - f\) is as
small as possible. Since Fran is hesitant and doesn’t know how many he wants to buy, Lana wants to
know the minimal value of the expression \(l - f\) for \(q\) different numbers \(k@@RISE_MATH_BLOCK_1@@i\).
Help her choose the chocolates and determine the minimum value of the expression \(l - f\) for each of the \(q\)
queries.

Subtask 1 (15 points): n, \(q \le 1000\), \(c\)\(i\), k\(i \le 10^{6}\)

Subtask 2 (20 points): \(k_{1}\) = . . . = \(k_{n}\)

Subtask 3 (35 points): No additional constraints.

The first line contains two integers \(n\) and \(q\) (\(1 \le n\), \(q \le 10^{5}\)), the number of chocolates, and the number of
queries.
The second line contains \(n\) integers \(c\)1, c2, . . . , c\(q\) (\(1 \le c@@RISE_MATH_BLOCK_0@@i\) and \(m@@RISE_MATH_BLOCK_1@@i \le 10^{9}\), \(1 \le m\)\(i \le n\)), Fran’s bound, and the
number of chocolates they are going to buy.

Print \(q\) lines. In the \(i-th\) line print the answer to Lana’s \(i-th\) query.

생성자가 기록되지 않았습니다.

출처 COCI 2022/2023 Contest 1