import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;


public class Main {

//	static int MAX = 10000;
	static int MAX = 2000000;
	static Object[] All = new Object[MAX+1];
	
	static int size( int x ) {
		if(x>999999) return 7;
		if(x>99999)  return 6;
		if(x>9999)   return 5;
		if(x>999)    return 4;
		if(x>99)     return 3;
		if(x>9)      return 2;
		return 1;
	}
	static int[] rotate( int value ) {
		List<Integer> result = new ArrayList<Integer>();
		int[] V = new int[8];
		int s = size(value);
		int x = value;
		
		for(int i=s-1;i>=0;i--) {
			V[i] = x%10;
			x /=10;
		}
		int rot;
		for(int i=1; i<s; i++) {
			if(V[i]!=0){
				rot=0;
				for(int j=0,ii=i;j<s; j++,ii=(ii+1)%s){
					rot=rot*10+V[ii];
				}
				if(rot>value && !result.contains(rot))
					result.add(rot);
			}
		}
		if( result.isEmpty() )
			return null;
		int[] r = new int[result.size()];
		for(int i=0; i<r.length; i++)
			r[i]=result.get(i);
		return r;
	}
	
	static void precalculate() {
		for(int i=1; i<=MAX; i++){
			All[i] = rotate(i);
		}
	}
	static int solve( Scanner in ) {
		int A, B, sol=0;
		
		A = in.nextInt();
		B = in.nextInt();

		for( int i=A; i<=B; i++) {
//			List<Integer> result = rotate(i);
			if( All[i]!=null ) {
				for(int value: (int[])All[i] ) {
					if( value <= B )
						sol++;
				}
			}
		}

		return sol;
	}
	
	public static void main ( String args[] ) {
		int T; 
		Scanner in = new Scanner(System.in);
		T = in.nextInt();
		int cnt=0;
		int sol;
		precalculate();
		for( cnt=1; cnt<=T; cnt++ ) {
			sol = solve( in );
			System.out.printf("Case #%d: %d\n", cnt, sol);
		}

	}
}

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.List;

public class recycled {
	
	static int f_recycled(String s_min,String s_max){
		  int num_recycled=0;
		  int min=Integer.parseInt(s_min);
		  int max=Integer.parseInt(s_max);
		  
		  //System.out.println("______________________________________\nNúmeros reciclados entre "+s_min+" y "+s_max);
		  
		  if (max>10){

			  int cab_max=s_max.charAt(0);
			  int cab_min, num;
			  String string_v;
			  int i, j, final_v;
			  String string_final_v;
			  
			  List<Integer> soluciones_valor=new ArrayList<Integer>();
			  boolean enc;
			  
			  int v=min;
			  while(v<=max){
				  string_v=String.valueOf(v);
				  cab_min=Character.getNumericValue(string_v.charAt(0));				  
				  for(i=1;i<string_v.length();i++){
					  num=Character.getNumericValue(string_v.charAt(i));
					  if( num <= cab_max &&   // cambio de dígitos no es mayor que max
						  num >= cab_min  ){ // cambio de dígitos no es menor que el valor original
						  string_final_v=string_v.substring(i)+string_v.substring(0, i);
						  final_v=Integer.parseInt(string_v.substring(i)+string_v.substring(0, i)); // back + front
						  if(string_v.length()==string_final_v.length()  && min<=v && v<max && v<final_v && final_v<=max){
							  
							  //System.out.println((num_recycled+1)+" - ["+v+","+final_v+"]");
							  
							  enc=false;
							  for(j=0;j<soluciones_valor.size();j++){ // evitar soluciones capicua 1212
								  if(soluciones_valor.get(j)==final_v){
									  enc=true;
								  }
							  }
							  if(!enc){
								  soluciones_valor.add(final_v);
								  num_recycled++;
							  }
						  }
					  }
				  }
				  soluciones_valor.clear();
				  v++;
			  }
		  }
		  
		  //System.out.println("RESULTADO "+num_recycled+" \n");
		  
		  return num_recycled;
	}
	
	public static void main(String[] args) throws IOException {
		FileReader fr = new FileReader(args[0]);
		BufferedReader bf = new BufferedReader(fr);
		int ntest=0;
		
		FileWriter fstream = new FileWriter("out.txt");
		BufferedWriter out = new BufferedWriter(fstream);
		
		String lines = bf.readLine();
		String liner, linew;
		int lines_r=0;
		String[] numbers;
		int total;
		
		while((liner = bf.readLine())!=null && lines_r<=Integer.parseInt(lines)) {
			ntest++;
			numbers=liner.split(" ");
			total=f_recycled(numbers[0],numbers[1]);
			linew="Case #"+ntest+": "+total+"\n";
			out.write(linew);
			lines_r++;
		}
		out.close();
		fr.close();
	}
}
