Now PIPI have a function f(x):
int f ( int x ) {
    if ( x == 0 ) return 0;
    return f ( x / 10 ) + x % 10;
}
For a given interval [A, B] (1 <= A <= B <= 10^9), calculate how many integer x that mod f(x) equal to 0.

There are multiple test cases.
Next T lines, Each line has one test case that has two integers A and B, separated by one blank space.

For each test case, output only one line containing the case number and an integer indicated the number of x.

困难