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.Scanner;
public class CodeJam3 {

	public static void main(String[] args) {
		Scanner in=new Scanner(System.in);
		int s=in.nextInt();
		for(int i=0;i<s;i++)
		{
			long c=0;
			long v1=in.nextInt();
			long v2=in.nextInt();
			for(long k=v1;k<v2;k++)
			{
				String begin=new Long(k).toString();
				long b=0;
				long n=0;
				for(int j=1;j<begin.length();j++)
				{ 
					String temp=begin.substring(j)+begin.substring(0,j);
					long t1=Long.parseLong(temp);
					n=t1;
					if(v1<=k && k<t1 && t1<=v2)
					{
						if(n!=b)
						{
							c++;
						}
						b=n;
						
					
					}
				}					
			}
			System.out.println("Case #"+(i+1)+": "+c);
		}
		

	}

}
