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.io.*;import java.util.*;
public class Solution3
{
	public static void main(String args[]) throws IOException
	{
		BufferedReader br=new BufferedReader(new FileReader("input.txt"));
	    PrintWriter pw=new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
	    int lines=Integer.parseInt(br.readLine());
	    for(int q=1;q<=lines;q++)
	    {
	    	StringTokenizer st=new StringTokenizer(br.readLine());
	    	int A=Integer.parseInt(st.nextToken());
		    int B=Integer.parseInt(st.nextToken());
		    int ctr=0;
		    for(int n=A;n<=B;n++)
		    {
		    	for(int m=n+1;m<=B;m++)
		    	{
		    			String s1=String.valueOf(n);
			    		String s2=String.valueOf(m);
			    		int x1,x2,i;
			    		for(i=0;i<s1.length();i++)
			    		{
			    			if(s1.charAt(0)==s2.charAt(i))
			    			{
			    			String chk1=s1.substring(0,s2.length()-i);
				    		String chk2=s1.substring(s2.length()-i);
				    		String chk3=s2.substring(0,i);
				    		String chk4=s2.substring(i);
				    		if(chk1.equals(chk4)&&chk2.equals(chk3))
				    		  { ctr++;}
			    			}
			    		}        
		        }    
		    }
		    pw.println("Case #"+q+": "+ctr);
	    }
	    pw.close();
	    
	    
    }
    
}