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 C;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

public class Main {
    public static void main(String[] args) throws FileNotFoundException{
        Scanner in = new Scanner(new File("c:\\c.in"));
        PrintWriter out = new PrintWriter(new File("c:\\c.out"));
        int t = in.nextInt();
        for (int j = 1; j <= t; j++) {
            int a = in.nextInt();
            int b = in.nextInt();
            Set<String> s = new HashSet<>();
            for (int i = a; i <= b; i++) {
                String n = i + "";
                int len = n.length();
  
                for (int k = 1; k < len; k++) {
                    String n2 = n.substring(k) + n.substring(0,k);
                    int nn = Integer.parseInt(n2);
                    if (n2.charAt(0)!='0' && nn > i && nn <= b && nn >= a) {
                        s.add(n+nn);
                    }
                }
                
            }
            
            out.println("Case #"+j+": "+s.size());
        }
        
        out.flush();
        out.close();
        in.close();
    }
}
