import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package problem.c.recycled.numbers;

import java.io.File;
import java.io.IOException;
import java.io.PrintStream;
import java.util.Scanner;

/**
 *
 * @author Park
 */
public class ProblemCRecycledNumbers {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) throws IOException {
        PrintStream out = new PrintStream(new File("/Users/Park/Desktop/output.txt"));
        Scanner in = new Scanner(new File("/Users/Park/Desktop/C-large.in"));
        int testCase = Integer.parseInt(in.next());
        for (int n = 0; n < testCase; n++) {
            int count = 0;
            //
            int start = Integer.parseInt(in.next());
            int end = Integer.parseInt(in.next());
            for (int i = start; i <= end; i++) {
                boolean chk = true;
                String num = i + "";
                int numLength = num.length();
                int[] alreadySearch = new int[numLength - 1];
                for (int j = 1; j < numLength; j++) {
                    String f = num.substring(0, j);
                    String b = num.substring(j);
                    int search = Integer.parseInt(b + f);
                    for (int k = 0; k < j - 1; k++) {
                        if (search == alreadySearch[k]) {
                            chk = false;
                            break;
                        }
                        chk = true;
                    }
                    alreadySearch[j - 1] = search;
                    if (chk && (search + "").length() == numLength && search != i && search >= start && search <= end) {
                        count++;
                    }
                }
            }
            out.println("Case #" + (n + 1) + ": " + count / 2);
            System.out.println("Case #" + (n + 1) + ": " + count / 2);
        }
        in.close();
        out.close();
    }
}
