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.ArrayList;
import java.util.Scanner;


public class C {

	
	public static void main(String[] argv){
		Scanner in = new Scanner ( System.in );
		int T=in.nextInt();
		
		for(int i=0; i<T; i++){
			
			int A=in.nextInt(); int B=in.nextInt();
			//boolean[] have=new boolean[B+1];  
			int Rep=0;
			
			for(int x=A; x<=B; x++){  ////???????????????????
				    String s=""+x;
				    if(s.length()==1)
				    	continue;
				    ArrayList<Integer> temp=new ArrayList<Integer>();
					for(int p=1; p<s.length(); p++){
						String s1=s.substring(0,p);
						String s2=s.substring(p,s.length());
						String res=s2+s1;
						int y=Integer.parseInt(res);
						if(y<=x )
							continue;
						
						// y>x
						else{
							if(y<=B & !temp.contains(y)){
								temp.add(y);
							Rep++;
							//System.out.println( x+" "+y);
							
							}
						}
							
					}
				
			}
			System.out.println("Case #"+(i+1)+": "+Rep);
			
			
		}
	}
	
}
 
