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.File;
import java.io.FileOutputStream;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Scanner;


public class B {
	public static void main(String ... args) throws Exception{
		Scanner in = new Scanner(new File("C-large.in"));
		PrintStream out = new PrintStream(new File("C-large.out"));
		
		
		int T = in.nextInt();
		in.nextLine();
		
		for(int t=0;t<T;t++){
			int A = in.nextInt();
			int B = in.nextInt();
			HashSet<String> set = new HashSet<String>();
			int found=0;
			for(int n=A;n<=B;n++){
				int high=(int)Math.log10(B);
				String orgNumber = new Integer(n).toString();
				do{
					String num = orgNumber;
					for(int i=0;i<num.length();i++){
						num = num.substring(num.length()-1) + num.substring(0,num.length()-1);
						int intNum = Integer.parseInt(num);
						if(intNum>n && intNum<=B && !set.contains(n+" "+intNum)){
							//System.out.println(n + " " + intNum);
							found++;
							set.add(n+" "+intNum);
						}
						
					}
					
					orgNumber = "0" + orgNumber;
				}while(orgNumber.length()<=high);
				
			}
			out.println("Case #" + (t+1) + ": " + found);
		}
		
		
	}
}
