Sum of Digits

Recursive sum of digits is the sum of its digits calculated till a single digit number is obtained. eg- $999 -> 9+9+9 -> 27 -> 2+7 -> 9$ Given three numbers $M$, $N$ and $X$, where $M \leq N$, find the count of the numbers in the range [$M$,$N$] whose recursive sum is $X$. The range is inclusive. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each t