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 Recycle {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		
		int cases = Integer.parseInt(sc.nextLine());
		
		for(int i = 0; i < cases; i++) {
			Scanner line = new Scanner(sc.nextLine());
			int A = line.nextInt();
			int B = line.nextInt();			
			
			int k = Integer.toString(A).length();
			
			int fac = (int) (Math.pow(10, k-1));
			
			IntSet set = new IntSet(k);
			
			int pairCount = 0;
			for(int n = A; n < B; n++) {
				set.clear();
				int m = n;
				for(int j = 0; j < k-1; j++) {
					int mod = m % 10;
					m = m / 10;
					m = m + (fac * mod);
					if(m <= B && m > n) {
						//if not already there
						if(!set.insert(m)) {
							pairCount++;
						}
					}
				}
			}
			System.out.printf("Case #%d: %d\n", i+1, pairCount);
		}

	}
	

}

class IntSet {
	
	int[] ints;
	int ctr = 0;
	
	public IntSet(int k) {
		ints = new int[k];
		ctr = 0;
	}
	
	public boolean contains(int x) {
		for(int i = 0; i < ctr; i++) {
			if(ints[i] == x) {
				return true;
			}
		}
		return false;
	}
	
	//true if x already contained
	public boolean insert(int x) {
		if(contains(x)) {
			return true;
		}
		ints[ctr] = x;
		ctr++;
		return false;
	}
	
	public void clear() {
		ctr = 0;
	}
}