Least Number

아직 제출이 없습니다시간 제한2초메모리 제한512 MB

문제 설명

예제1

문제

You are given a number $N$ and a digit $d$ . Consider all numbers which do not contain digit $d$ in their decimal notation. Find the minimum such number for which the sum of its digits is exactly $N$ .

입력

The first line contains two integers $N$ and $d$ ( $2 \le N \le 10^{6}$ , $0 \le d \le 9$ ).

출력

Print one integer: the minimum number which does not contain digit $d$ and has the sum of its digits equal to $N$ .