100422: [AtCoder]ABC042 C - Iroha's Obsession

Memory Limit:256 MB Time Limit:2 S
Judge Style:Text Compare Creator:
Submit:0 Solved:0

Description

Score : $300$ points

Problem Statement

Iroha is very particular about numbers. There are $K$ digits that she dislikes: $D_1, D_2, ..., D_K$.

She is shopping, and now paying at the cashier. Her total is $N$ yen (the currency of Japan), thus she has to hand at least $N$ yen to the cashier (and possibly receive the change).

However, as mentioned before, she is very particular about numbers. When she hands money to the cashier, the decimal notation of the amount must not contain any digits that she dislikes. Under this condition, she will hand the minimum amount of money.

Find the amount of money that she will hand to the cashier.

Constraints

  • $ 1 ≦ N < 10000$
  • $ 1 ≦ K < 10$
  • $ 0 ≦ D_1 < D_2 < … < D_K≦9$
  • $\{D_1,D_2,...,D_K\} ≠ \{1,2,3,4,5,6,7,8,9\}$

Input

The input is given from Standard Input in the following format:

$N$ $K$
$D_1$ $D_2$ … $D_K$

Output

Print the amount of money that Iroha will hand to the cashier.


Sample Input 1

1000 8
1 3 4 5 6 7 8 9

Sample Output 1

2000

She dislikes all digits except $0$ and $2$.

The smallest integer equal to or greater than $N=1000$ whose decimal notation contains only $0$ and $2$, is $2000$.


Sample Input 2

9999 1
0

Sample Output 2

9999

Input

题意翻译

买家想买一个价格为N的物品,但他又讨厌k个数字,分别为D_1,D_2,……,D_K。问他最少出多少钱,才能在保证买下这个物品的同时使自己出的钱不包括自己讨厌的数字。

加入题单

上一题 下一题 算法标签: