You are given all positive integers in the range from 10 to 99 inclusive. Find the number of ways to choose from them exactly k different numbers (selection order is important) so that after gluing them in one big line, the resulting number is divisible by x.
The first line contains the number of test cases t (1 ≤ t ≤ 100). Each test case is given in a separate line and contains two numbers: k (1 ≤ k ≤ 5) and x (1 ≤ x ≤ 100), separated by a space.
For each test case print the answer in a single line according to format specified in example.