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 static java.lang.Math.*;

public class C {
	public static void main(String[] args)
	{
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		for(int cases = 1; cases <= T;cases++){
			int A = in.nextInt();
			int B = in.nextInt();
			int ans = 0;
			
			
			for(int i = A ; i < B+1; ++i)
			{
				String stringValue = Integer.toString(i);
				HashSet set = new HashSet();
				for(int j = 1; j <stringValue.length(); ++j)
				{
					stringValue = stringValue.substring(1) + stringValue.charAt(0);
					int BB = Integer.parseInt(stringValue);
					if( stringValue.charAt(0) != '0' && i < BB && A <=BB && BB <= B
					    && !set.contains(BB)
 					)
					{
						set.add(BB);
						ans = ans+1;
					}
				}
			
			}
			
			System.out.format("Case #%d: %d\n", cases, ans);
			
			
						
			
			
		}
	}
}
