import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Recycled {
    public static void main(String[] args) {
        try {
            BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
            int t = Integer.parseInt(br.readLine());
            for (int i = 0; i < t; i++) {
                String[] str = br.readLine().split(" ");
                int a = Integer.parseInt(str[0]);
                int b = Integer.parseInt(str[1]);
                System.out.println("Case #" + (i + 1) + ": " + find(a, b));
            }
        } catch (IOException e) {
            e.printStackTrace();
        }
    }

    private static int find(int a, int b) {
        HashSet<Long> used = new HashSet<Long>();
        int digits = String.valueOf(a).length();
        if (digits == 1) return 0;
        for (int i = a; i <= b; i++) {
            int s = 10;
            int m = (int) Math.pow(10, digits-1);
            for (int j = 0; j < digits-1; j++) {
                int r = i % s;
                if (r < s/10) continue;
                int q = i / s;
                int rn = r * m + q;
                s *= 10; m /= 10;
                if (i != rn && rn >= a && rn <= b) {
                    long pp;
                    if (rn < i) pp = (long)rn << 30 | i;
                    else pp = (long)i << 30 | rn;
                    if (!used.contains(pp)) {
                        used.add(pp);
                    }
                }
            }
        }
        return used.size();
    }
}

import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.Scanner;


public class Main {

	/**
	 * @param args
	 */
	
	public static int numShift(int A, int digit){

		int num = 0, div;
		num = A %10;
		div = A /10;
		for(int i=1; i < digit ; i++)
		{
			num = num*10;
		}
		num = num + div;
		return num;
	}
	

	public static int recycleCount(int A, int B)
	{
		int count = 0;
		int num = A;
		String digit = "" + A;
		do
		{
			num = numShift(num, digit.length());
			if(num > A && num <= B)
				count++;
		}while(num != A);
		
		//System.out.print("Count: " + count + "\n");
		return count;
	}
	
	public static void runCase(int A, int B, int casenum)
	{
		int count =0;
		for(int i=A; i<B; i++)
		{
			count += recycleCount(i, B);
		}
		System.out.print("Case #" + casenum + ": " + count + "\n");
	}
	
	public static void main(String[] args) throws FileNotFoundException {
		File ffile = new File(args[0]);
		Scanner scanner;
		scanner = new Scanner(new FileReader(ffile));
		
		int N = scanner.nextInt();
		int A, B;
		for(int i =0; i<N; i++)
		{
			A = scanner.nextInt();
			B = scanner.nextInt();
			runCase(A, B, i+1);
		}
		
	}

}
