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));
	}
}

import java.util.LinkedList;
import java.util.Scanner;
public class problemC
{
    static final int until = 1000;
    static LinkedList<Integer> res[] = new LinkedList[until+1];
    static Object speed[][] = new Object[until+1][];
    public static void main(String []args)
    {
        for(int i=1;i<=until;i++)
            GO(i);
        for(int i=1;i<=until;i++)
            speed[i] = res[i].toArray();
        Scanner scanner = new Scanner(System.in);
        int N = scanner.nextInt();
        for(int num=1;num<=N;num++)
        {
            int ret = 0;
            int A = scanner.nextInt();
            int B = scanner.nextInt();
            for(int i=A;i<=B;i++)
            {
                int len = res[i].size();
                for(int j=0;j<len;j++)
                    if(((Integer)speed[i][j])<=B)
                        ret++;
            }
            System.out.println("Case #"+num+": "+ret);
        }
    }
    public static void GO(int num)
    {
        res[num] = new LinkedList<Integer>();
        String str = Integer.toString(num);
        int len = str.length();
        for(int i=0;i<len;i++)
        {
            str = str.substring(1,len)+str.charAt(0);
            int rev = new Integer(str);
            if(!res[num].contains(rev) && rev>num)
                res[num].add(rev);
        }
    }
}
