Let $A = \sum_{i=1}^{n}a_i * {10}^{n-i}(1\leq a_i \leq 9)$($n$ is the number of $A$'s digits). We call $A$ as ˇ°beautiful numberˇ± if and only if $a[i] \geq a[i+1]$ when $1 \leq i
Input
The fist line contains a single integer $T$(about 100), indicating the number of cases.
Each test case begins with two integers $L,R(1 \leq L \leq R \leq {10}^{9})$.
Output
For each case, output an integer means the number of ˇ°beautiful numberˇ±.
