Let us consider the set of integer numbers between 1 and N inclusive. Let us order them lexicographically (i. e. like in the vocabulary), for example, for N = 11 the order would be: 1, 10, 11, 2, 3, 4, 5, 6, 7, 8, 9.</p>

Let us denote the position of the number K in this ordering as Q_N,K. For example, Q_11,2 = 4. Given numbers K and M find the smallest N such that Q_N,K = M.

입력 형식

Input contains two integer numbers K and M (1 ≤ K, M ≤ 10⁹) separated by a space.

출력 형식

If such N that Q_N,K = M exists then write to the output file the smallest such N, otherwise write 0.

예제 입력 1

2 4

예제 출력 1

11

예제 입력 2

2 1

예제 출력 2

0

예제 입력 3

100000001 1000000000

예제 출력 3

100000000888888879

예제 입력 4

1000000000 11

예제 출력 4

0