C. Ascending numbers

A number is called ascending if its digits seen from left to right
(that is most significant to least significant) are non-decreasing. So,
0003 and 1122 are ascending numbers but 1011 is not (you are allowed
to use one or more leading zeroes).

You will write a program to count the number of possible j-digit
ascending numbers for given values of j.

Input
-----
The first line of input will contain the number of inputs n 
(n < 1000); the next n lines each contains the input number (starting
with 1), followed by a space, followed by a decimal integer giving the
number of digits j, which lies between 1 and 64 (both inclusive). 

Output
------
For each input there is one line of output. It contains the input
number followed by a single space, followed by the number of ascending
j-digit numbers.

Sample Input
------------
2
1 2
2 10

Sample Output
-------------
1 55
2 92378