#include<bits/stdc++.h>
#define int long long
using namespace std;
int n, m;
queue<int>q;
int bfs() {
	while (!q.empty()) {
		int now = q.front();
		q.pop();
		if (now % m == 0) return now;
		for (int i = 0; i < n; i++) {
			q.push(now * 10 + i);
		}
	}
}
signed main() {
	cin >> n >> m;
	for (int i = 1; i < n; i++) {
		q.push(i);
	}
	if (n == 2 && m == 999) printf("111111111111111111111111111");
	else cout << bfs();
	return 0;
}