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

public class recycled_numbers {
	public static void main(String[]a) throws Exception{
		
		Scanner f = new Scanner(new File(a[0]));
		int result=0;
		int A,B;
		String n,m;
		HashSet<String> s=new HashSet<String>();
		
		int T=f.nextInt();	//T total case count
		for (int t=1; t<=T;t++){//for each case t
			
			s.clear();
			result=0;				//reset
			A=f.nextInt();B=f.nextInt();	//get values for next case
			
			if (A==B)result=0;//remove case not meeting problem limits 
			else{
				for(int i=A;i<=B;i++){//for each int in range
					n=Integer.toString(i);
					m=new String(n);
					//System.out.println(n);
					for (int j=1;j<n.length();j++){//move each digit to the front & test
						m = m.substring(m.length()-1)+m.substring(0,m.length()-1);
						if(m.matches("^0+[\\d]+")!=true &&
								Integer.parseInt(m)<=B &&
								Integer.parseInt(n)<Integer.parseInt(m)){
							s.add(new String(n+","+m));
							//result++;
							//System.out.println(" matched: "+m);
						}
						
					}
				}
				result = s.size();
			}

			//display output
			System.out.println("Case #" + t + ": " + result);
		}
	}
}
import java.util.*;
import java.io.*;

class C1Large
{
	public static void main(String[] args) throws Exception 
	{
		FileInputStream fis = new FileInputStream("C-large.in");
		Scanner scan = new Scanner(fis);
		FileWriter fw = new FileWriter("output.txt");
		int T = scan.nextInt();
		for(int c = 1; c<=T;c++)
		{
			long A = scan.nextInt();
			long B = scan.nextInt();
			int digit = String.valueOf(A).length();
			int count=0;
			
			for(long i=A;i<=B;i++)
			{
				String mut = String.valueOf(i);
				long tmp =0;
				long[] mem = new long[digit];
				boolean counted = false;
				for(int j=1;j<digit;j++)
				{
					tmp = Long.parseLong(mut.substring(j,digit) + (mut.substring(0,j)));
					mem[j-1] = tmp;
					counted = false;
					if(tmp > Long.parseLong(mut) && tmp >=A && tmp <=B)
					{
						for(int k=0;k<j-1;k++)
						{
							if(mem[k] == tmp)
							{	
								counted = true;
								break;
							}
						}
						if(!counted)
						{
//							System.out.println("counted :"+ A + "<=" +mut +"<"+ tmp +"<=" +B);
							count++;
						}
					}
				}
			}
			if(digit > 1 )
				fw.write("Case #" +c +": "+ count +"\n");
			else
				fw.write("Case #" +c +": "+ 0 +"\n");
		}
		fw.close();
	}
}