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

package y2012;

import java.io.File;
import java.io.PrintWriter;
import java.util.HashMap;
import java.util.Scanner;

public class QR3 {
	
	public static void main(String[] args) throws Exception {
		Scanner inputFile=new Scanner(new File(args[0]));
		PrintWriter outputFile=new PrintWriter(new File(args[1]));
			
		int t=Integer.parseInt(inputFile.nextLine());	
		for(int i=0;i<t;i++){
			HashMap<String, String> result = new HashMap<String, String>();
			
			String[] aCase = inputFile.nextLine().split(" ");
			
			int iFrom = Integer.parseInt(aCase[0]);
			int iTo = Integer.parseInt(aCase[1]);
			String sFrom = String.valueOf(iFrom);
			String sTo = String.valueOf(iTo);

			int numDigit = sFrom.length();
			
			if(numDigit != 1) {
				for(int curr = iFrom; curr < iTo; curr++) {
					String sCurr = String.valueOf(curr);

					for(int j=1; j<numDigit; j++) {
						int swapped = Integer.parseInt(sCurr.substring(j) + sCurr.substring(0, j));
						if(iFrom <= swapped && swapped <= iTo && swapped != curr) {
							if(curr < swapped)
								result.put(String.valueOf(curr)+","+String.valueOf(swapped), null);
							else
								result.put(String.valueOf(swapped)+","+String.valueOf(curr), null);
						}
					}
				}
			}
			
			outputFile.println("Case #"+(i+1)+": " + result.size());
			System.out.println("Case #"+(i+1)+": " + result.size());
		}

		inputFile.close();
		outputFile.close();
	}
}
