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.*;
public class CodeJamC {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		int A,B,tc;
		Scanner sc= new Scanner(System.in);
		tc=sc.nextInt();
		for(int TC=1; TC<=tc; TC++){
		A=sc.nextInt();
		B=sc.nextInt();
		int suma=0;
		Integer Ai= new Integer(A);
		String sA=Ai.toString();
		String rigth;
		String aux;
		Integer n;
		for(int i=A; i<=B; i++){
			
			Integer si= new Integer(i);
			String Ssi=si.toString();			
			for(int j=1; j<Ssi.length(); j++){				
				rigth=Ssi.substring(j);		
				aux= rigth + Ssi;				
				n=Integer.valueOf(aux.substring(0,Ssi.length()));				
				if (n<=B && n>=A && si<n){
					//System.out.println("( " + si + " , " + n + ")");
					suma++;
				}
			}				
		}
		System.out.println("Case #"+TC+": "+suma);
		}

	}

}
