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.*;

public class Main {

	static int digits(int A){
		if (A<10) return 1;
		return 1+digits(A/10);
	}
	static int[] decimal(int n, int d){
		int[] t = new int[d];
		
		for (int i = d-1; i>=0; i--){
			t[i]=n-10*(n/10);
			n=n/10;
		}
		
		return t;
	}
	static boolean equals(int[] t1, int[] t2, int d){
		for (int i=0; i<d; i++){
			if (t1[i]!=t2[i]) return false;
		}
		return true;
	}
	
	static boolean permute(int[] t1, int[] t2, int d){
		
		for (int j = 0; j<d; j++){
			int aux=t1[0];
			for (int i=0; i<d-1; i++) t1[i]=t1[i+1];
			t1[d-1]=aux;
			
			if (equals(t1, t2, d)) return true;
		}
		
		return false;
	}
	
	public static void main(String[] args){
		Scanner in = new Scanner(System.in);
		int T =in.nextInt();
		for (int k = 1; k<=T; k++){
			int A = in.nextInt();
			int B = in.nextInt();
			int comp = 0;
			int d = digits(A);
			
			for(int m = A; m<=B; m++){
				for (int n =A; n<m; n++){
					int t1[] = decimal(n,d);
					int t2[] = decimal(m,d);
					if (permute(t1, t2, d)) comp++;
				}
			}
			
			
		
		
		
		System.out.println("Case #"+k+": "+comp);
		}
	}
}
