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.io.*;
import java.util.*;
public class Solve {



	public static void main ( String args[] ) throws FileNotFoundException, IOException {
		BufferedReader in = new BufferedReader( new FileReader ( args[0] ) );
		BufferedWriter out = new BufferedWriter( new FileWriter ( "outfile.txt" ) );
		int cases = Integer.parseInt( in.readLine() );
		String[] tmp;
		int low, high, multiplier, shift, rest, pairs;
		HashSet<Integer> used;
		for ( int i = 1; i <= cases; i++ ) {
			pairs = 0;
			tmp = in.readLine().split( " " );
			low = Integer.parseInt( tmp[0] );
			high = Integer.parseInt( tmp[1] );
			multiplier = 1;
			for ( int j = 1; j < tmp[0].length(); j++ ) {
				multiplier *= 10;
			}
			for ( int j = low; j < high; j++ ) {
				shift = j;
				used = new HashSet<Integer>();
				for ( int k = 0; k < tmp[0].length(); k++ ) {
					rest = shift % 10;
					shift /= 10;
					shift += rest * multiplier;			
					if ( j < shift && shift <= high ) {
						if ( !used.contains( shift ) ) {
							pairs++;
							used.add( shift );
						}
					}
				}
			}
			out.write( "Case #" + i + ": " + pairs );
			out.newLine();
			out.flush();
		}
		in.close();
		out.close();
	}	


}
