Problem:
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

Solution in Python (3.4.3) (judge verdict: Wrong Answer)

# -*- coding: utf-8 -*-
# 環境によってはコメントに全角文字を使うとエラーが出るため

#すべてを str型として読み込み、Kのみ int型に変換
N, Kstr = map(str, input().split()) # N: 元の数, K: NG数の数
K = int(Kstr)
D = list(map(str, input().split())) # D: NG数のリスト

# N = str(1000)
# K = 8
# D = ('1', '3', '4', '5', '6', '7', '8', '9')

def getMinimumOK():
# NGではない最小の数字を求める
    for i in range(0, 9):
        for j in range(1, K):
            if D[j - 1] == str(i):
                break
            else:
                return str(i)

def getFirstNG():
# Nの中にNG数が含まれていれば 最初のNG数までの文字数を、含まれなければ -1 を返す
    for i in range(0, len(N) - 1):
        for ng in D:
            if ng == N[i]:
                return i + 1
    return -1

def isOK(number):
# NG数が含まれなければ True, 含まれていれば False を返す
    strNumber = str(number)
    for i in range(0, len(strNumber) - 1):
        for ng in D:
            if ng == N[i]:
                return False
    return True

def makeUpperHalf(upperHalf_org):
    numUpper = int(upperHalf_org)
    while True:
        numUpper += 1
        if isOK(numUpper):
            break
    return str(numUpper)

minimumOK = getMinimumOK() # 最小のOK数字（文字列型）
firstNG = getFirstNG() # 上位から数えて最初のNG数が出てくる桁

if firstNG == -1: # NG数が含まれない場合
    print(N)
else:
    upperHalf = N[:firstNG] # 先頭から最初のNG数まで
    lowerHalf = N[firstNG:] # 最初のNG数の次から末尾まで
    upper = makeUpperHalf(upperHalf)
    lower = minimumOK * len(lowerHalf) # 下位半分はNGでない最小の数を桁数分、並べる
    print(upper + lower)