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.io.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.util.StringTokenizer;


public class RecycledNumbers {
	public static int calcRecycled(int A, int B) {
		int total = 0;
		for(int i = 0; i < B-A+1; i++) {
			int[] temp = getCycles(i+A);
			for(int x: temp) {
				if(x == -1)
					continue;
				if(x <= i+A)
					continue;
				if(x <= B && x >= A) {
					total++;
				}
			}
		}
		return total;
	}
	public static int[] getCycles(int init) {
		String s = init+"";
		int[] array = new int[s.length()-1];
		for(int i = 0; i < s.length()-1; i++) {
			if(s.charAt(i+1) == '0')
				array[i] = -1;
			else {
				int temp = Integer.parseInt(s.substring(i+1) + s.substring(0, i+1));
				for(int j = 0; j < i; j++) {
					if(array[j] == temp) {
						temp = -1;
						break;
					}
				}
				array[i] = temp;
			}
		}
		return array;
	}
	public static void main(String[] args) throws IOException {
		BufferedReader read = new BufferedReader(new FileReader("C-small-attempt0.in.txt"));
		int T = Integer.parseInt(read.readLine());
		for(int i = 1; i <= T; i++){
			StringTokenizer st = new StringTokenizer(read.readLine());
			int A = Integer.parseInt(st.nextToken());
			int B = Integer.parseInt(st.nextToken());
			System.out.println("Case #" + i + ": " + calcRecycled(A, B));
		}
	}
}
