Restoring Increasing Sequence

1000ms

262144K

Description:

Peter wrote on the board a strictly increasing sequence of positive integers a₁, a₂, ..., a_n. Then Vasil replaced some digits in the numbers of this sequence by question marks. Thus, each question mark corresponds to exactly one lost digit.

Restore the the original sequence knowing digits remaining on the board.

Input:

The first line of the input contains integer n (1 ≤ n ≤ 10⁵) — the length of the sequence. Next n lines contain one element of the sequence each. Each element consists only of digits and question marks. No element starts from digit 0. Each element has length from 1 to 8 characters, inclusive.

Output:

If the answer exists, print in the first line "YES" (without the quotes). Next n lines must contain the sequence of positive integers — a possible variant of Peter's sequence. The found sequence must be strictly increasing, it must be transformed from the given one by replacing each question mark by a single digit. All numbers on the resulting sequence must be written without leading zeroes. If there are multiple solutions, print any of them.

If there is no answer, print a single line "NO" (without the quotes).

Sample Input:

3
?
18
1?

Sample Output:

YES
1
18
19

Sample Input:

2
??
?

Sample Output:

NO

Sample Input:

Sample Output:

Informação

Provedor Codeforces

Código CF490E