import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

package google;

import java.io.FileNotFoundException;
import java.io.IOException;
import java.util.Scanner;

public class Recycled 
{
    public static void main(String[] args) throws FileNotFoundException, IOException 
    {
        IO.changeGoogleIO('C', 0);
        
        Scanner input = new Scanner(System.in);
        
        int n = input.nextInt();
        int a, b;
        int x, digit;
        int len;
        int result0;
        String s;
        String result;
        
        for (int i = 0; i < n; ++i) 
        {
            result = "Case #" + (i + 1) + ": "; 
            
            a = input.nextInt();
            b = input.nextInt();
            
            result0 = 0;
            
            for (int j = a; j <= b; ++j) 
            {
                s = j + "";
                len = s.length();
                
                do
                {
                    s = s.charAt(len - 1) + s.substring(0, len - 1); 
                    
                    x = Integer.parseInt(s);
                            
                    if ((x > j) && (x >= a) && (x <= b))
                        ++result0;
                }
                while (x != j);
            }
            
            result += result0;
            
            System.out.println(result);
        }
    }
}
