import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

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

public class ReNum {

	static BufferedReader br;
	static PrintWriter pw;
	
    public static void main(String args[]) {
        try {
            br = new BufferedReader(new FileReader("C-large.in"));
			pw = new PrintWriter(new File("ReNumAns.out"));
			String no = br.readLine();
            int number = Integer.parseInt(no);
            for (int h = 0; h <= number - 1; h++) {
                int finAns =0;
                String nos = br.readLine();
                String[] n = nos.split(" ");
                int num1 = Integer.parseInt(n[0]);
                int e = Integer.parseInt(n[1]);
                int size = n[0].length();
               
                
                for (int i=num1;i<=e;i++){
                    String t = Integer.toString(i);
                    for (int j = 1;j<size;j++){
                        t= t.substring(1,size)+t.substring(0,1);
                        
                        int num2 = Integer.parseInt(t);
                        if (num2>i && num2<=e && num2>=num1){
                            finAns++;
                            
                            
                        }
                                                
                    }
                }

                int caseNo = 1 + h;
                String ans = "Case #" + caseNo + ": " + finAns;
                pw.println(ans);
                pw.flush();

            }


        } catch (IOException e) {
            e.printStackTrace();

        }
    }

}
