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 C++14 (GCC 5.4.1) (judge verdict: Wrong Answer)

#include<iostream>
#include<cstdio>
#include<cstring>
#include<queue>
#include<algorithm>
#define MAXN 10010
using namespace std;
int n,m;
bool dont[MAXN],used[MAXN];
int last[MAXN],ans[MAXN];
void print(int next,int ceng)
{
    if(ceng&&!next) return;
    print(last[next],ceng+1);
    printf("%d",ans[next]);
}
int main()
{
    scanf("%d%d",&n,&m);
    bool judge=false;
    memset(dont,false,sizeof(dont));
    memset(used,false,sizeof(used));
    for(int i=1; i<=m; i++)
    {
        int temp;
        scanf("%d",&temp);
        dont[temp]=true;
    }
    queue <int> q;
    while(!q.empty()) q.pop();
    q.push(0);
    while(!q.empty())
    {
        int now=q.front();
        q.pop();
        for (int i=0; i<10; i++)
        {
            if(dont[i]||!now&&!i) continue;
            int mod=(now*10+i)%n;
            if(!used[mod])
            {
                q.push(mod);
                used[mod]=true;
                last[mod]=now;
                ans[mod]=+i;
                if(!mod)
                {
                    judge=true;
                    break;
                }
            }
        }
        if(judge) break;
    }
    if(judge)
    {
        print(0,0);
        printf("\n");
    }
    else printf("-1\n");
    return 0;
}