Consider the integers from to . Define the weight of a number as the sum of its digits. Let the weight of be denoted as .
Arrange these numbers in graded lexicographic order. For two numbers and : if w(a) < w(b), then comes before in graded lexicographic order. If w(a) = w(b), then comes before if and only if the decimal representation of is lexicographically less than the decimal representation of .
For example, in this order:
comes before ;
comes before ;
comes before .
Given and , find the number at the -th position in the graded lexicographic ordering of natural numbers from to .
The input file contains two integers and (1 \leq k \leq n \leq 10^{18}).
Output the position number on the first line.
Output the number at the -th position on the second line.
Example 1