package codejam;

import java.util.*;
import java.io.*;

public class RecycledNumbers {
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new FileReader("in.txt"));
		PrintWriter out = new PrintWriter(new File("out.txt"));
		
		int T = Integer.parseInt(in.readLine());
		for (int t = 1; t <= T; ++t) {
			String[] parts = in.readLine().split("[ ]+");
			int A = Integer.parseInt(parts[0]);
			int B = Integer.parseInt(parts[1]);
			
			int cnt = 0;
			for (int i = A; i < B; ++i) {
				String str = String.valueOf(i);
				int n = str.length();
				String res = "";
				Set<Integer> seen = new HashSet<Integer>();
				for (int j = n - 1; j > 0; --j) {
					res = str.substring(j) + str.substring(0, j);
					int k = Integer.parseInt(res);
					if (k > i && k <= B) {
						//System.out.println("(" + i + ", " + k + ")");
						if (!seen.contains(k)) {
							++cnt;
							seen.add(k);
						}
					}
				}
			}

			out.println("Case #" + t + ": " + cnt);
		}
		
		in.close();
		out.close();
		System.exit(0);
	}
}

import java.util.HashSet;
import java.util.Scanner;
import java.util.Set;

/**
 * Created by IntelliJ IDEA.
 * User: nickg
 * Date: 4/13/12
 * Time: 9:57 PM
 * To change this template use File | Settings | File Templates.
 */
public class CodeJamThree {
    public static int numNumbers(int a, int b){
        int digits = (int) Math.log10(b);
        digits++;
        Set<Integer> seen = new HashSet<Integer>();
        int total = 0;
        for(int x = a; x < b; x++){
            int pow = 10;
            seen.clear();
            for(int y = 1; y < digits; y++){
                int moved = move(x, pow);
                pow*= 10;
                if(moved <= b && moved > x)
                    seen.add(moved);
            }
            total+= seen.size();
        }
        return total;
    }

    public static int move(int src, int pow){
        int smallPart = src / pow;
        int bigPart = src % pow;
        int factor =  (int) Math.log10(smallPart) + 1;
        pow = (int) Math.pow(10, factor);
        return bigPart * pow + smallPart;
    }

    public static void main(String[] args) {
        Scanner scanner = new Scanner(System.in);
        int numTrials = scanner.nextInt();
        for(int i = 0; i < numTrials; i++){
            int i1 = numNumbers(scanner.nextInt(), scanner.nextInt());
            System.out.println("Case #" + (i+1) + ": " + i1);
        }
    }
}
