CF490E.Restoring Increasing Sequence

Peter wrote on the board a strictly increasing sequence of positive integers _a_1, _a_2, ..., 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.

彼得在黑板上写下一个严格递增的正整数序列 $a_1,\,a_2,\,\dots,\,a_n$。随后，瓦西里将该序列中某些数字的若干数位替换为了问号。每个问号恰好对应一个丢失的数位。

请根据黑板上剩余的数字，还原出原始序列。

The first line of the input contains integer n (1 ≤ n ≤ 105) — 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.

输入的第一行包含一个整数 $n$（$1 \leq n \leq 10^5$）—— 表示序列的长度。接下来的 $n$ 行每行包含序列中的一个元素。每个元素仅由数字和问号组成，且不以数字 $0$ 开头。每个元素的长度为 $1$ 到 $8$ 个字符（含端点）。

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).

如果答案存在，在第一行输出“YES”（不带引号）。接下来的 $n$ 行必须包含一个正整数序列——即彼得序列的一种可能方案。所找到的序列必须严格递增，且必须通过对给定序列中每个问号（?）替换为一个单独数字而得到。最终序列中的所有数字均不得含有前导零。若存在多个解，输出任意一个即可。

若无解，则仅输出一行“NO”（不带引号）。