Being a professional trader, Sakurako created a plan for the next days. On the -th day, she must invest a certain amount of coins in the range [a_i-x, a_i+x], where is a fixed integer that Sakurako has at the very beginning. Notice that she may invest even a negative amount of coins, which is crazy.
However, she wouldn't be a professional trader if she did not have an ace strategy up her sleeve. Her strategy is that she will invest strictly more coins than she has invested on the previous day. Formally, if she chooses to invest b_1,b_2,\dots, b_n integer coins respectively on each of the days, the condition b_1< b_2< \dots < b_n must be held, where a_i-x\le b_i\le a_i+x.
Your task is to detect whether her strategy may succeed and output one of Sakurako's possible plans.
The first line contains two integers and (1\le n\le 2\cdot 10^5; 0\le x\le 10^9) — the number of days and a fixed Sakurako's integer.
The second line contains integers a_1,a_2,\dots, a_n ~(0\le a_i\le 10^9) — values that describe Sakurako's plan.
In the first line, output "YES" if Sakurako's plan may succeed and "NO" otherwise.
If your output in the first line is "YES", output the integers b_1, b_2, \dots, b_n (-2\cdot 10^9 \leq b_i \leq 2 \cdot 10^9) of her final investments in the second line.
Notice that there may be many possible answers; you are allowed to output an arbitrary one that meets the conditions described in the statement.
Example 1
In the first example,
1-4\le -3\le 1+4;
4-4\le 0\le 4+4;
2-4\le 1\le 2+4;
1-4\le 2\le 1+4;
3-4\le 3\le 3+4.
In this problem, there are conditional blocks. If your solution works correctly for certain constraints, it will receive a certain number of points. Note that testing is going test by test, but not by blocks.
( points): x=1; that is, Sakurako's fixed number equals .
( points): without additional constraints.