1
#include<bits/stdc++.h>
2
using namespace std;
3
int k,m;
4
int minn[1010];
5
void bfs()
6
{
7
    queue<string>q;
8
    q.push(to_string(0));
9
    while(!q.empty())
10
    {
11
        string tmp=q.front();
12
        q.pop();
13
        int num=0;
14
        for(int i=0;i<tmp.size();i++)
15
        {
16
            num*=10;
17
            num+=int(tmp[i]-'0');
18
        }
19
        for(int i=0;i<k;i++)
20
        {
21
            int a=num;
22
            a*=10;
23
            a+=k;
24
            if(a%m==0&&a!=0)
25
            {
26
                cout<<a;
27
                return;
28
            }
29
            else if(a==0)
30
            {
31
                break;
32
            }
33
            else
34
            {
35
                if(minn[a%m]>=a)
36
                {
37
                    break;
38
                }
39
                else
40
                {
41
                    minn[a%m]=a;
42
                }
43
            }
44
            q.push(to_string(a));
45
        }
46
    }
47
}
48
int main()
49
{
50
    cin>>k>>m;
51
    memset(minn,0x3f3f3f3f,sizeof(minn));
52
    bfs();
53
    return 0;
54
}