import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.util.Scanner;
public class Rec {
static Scanner sc =new Scanner(System.in);
public  static void main (String [] args ) {
int n =sc.nextInt();

for (int m =1; m <= n; m++) handleCase(m);
}
public static int a,b;
static void handleCase(int num) {
int sum=0;
 a =sc.nextInt();
 b =sc.nextInt();
for (int i =a; i <=b;i++) {
for (int j =a; j <i;j++) {
if (i==j) continue;
sum +=perm(i, j);
}
}
System.out.println("Case #" +num +": "+sum);
}

static int perm(int j, int k) {
String s =new Integer(j).toString();
//boolean [][] f=new boolean[b-a][b-a];
String t =new Integer(k).toString();
int sum =0;
for (int div =1;div < s.length();div++) {
String r =s.substring(div) +s.substring(0,div);
if (r.equals(t)) {
//if (f [j-a][k-a]) System.out.println(s +"&"+t);
//System.out.println(t+"=" +s+"p"+div);
//f [j-a][k-a] =true;
//f [k-a][j-a] =true;
sum++;
break;
}
}
return sum;
}

}
