The duck does not like the conditions.#9094
The Great Duck loves solving problems but prefers concise statements, so she asked me to make the problem statement as short as possible.
You are given an array of length and a number . Each element of the array is either , , or . Your task is to replace all zeros with either or so that the sum of the array becomes positive and divisible by .
The first line contains two integers and (1 \le n, k \le 2 \cdot 10^5) — the number of elements and the divisor for the sum.
The second line contains integers a_1, a_2, \dots, a_n (-1 \le a_i \le 1) — the elements of the array.
If it is possible to replace all zeros with or so that the sum of the array elements is positive and divisible by , print YES on the first line, and in the second line print integers — the elements of the new array. If there are several possible solutions, print any.
Otherwise, print NO on a single line.
Example 1
Example 2
Example 3
Example 4