import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
import java.util.*;
import java.io.*;

public class C2 {
	public static String convert(int num) {
		char[] arr = Integer.toString(num).toCharArray();
		Arrays.sort(arr);
		return new String(arr);
	}
	
	// count lower than A
	public static long countRecycle(int A, int num) {
		//long ans = 0;
		
		StringBuffer s = new StringBuffer(Integer.toString(num));
		HashSet<Integer> set = new HashSet<Integer>();
		for(int i=0;i<s.length(); i++) {
			char c = s.charAt(0);
			s = s.deleteCharAt(0);
			s = s.append(c);
			
			int anotherNum = Integer.parseInt(s.toString());
			if (anotherNum >= A && anotherNum < num){ 
				//System.out.println("RECYCLED: "+num+" "+anotherNum);
				//++ans;
				set.add(anotherNum);
			}
		}
		
		return set.size();
	}
	
	public static void main(String[] args) throws Exception{
		Scanner in = new Scanner(System.in);
		int T = in.nextInt();
		
		int A, B;
		long ans;
		
		for(int caseNo = 1;caseNo <= T; caseNo++) {
			A = in.nextInt();
			B = in.nextInt();
			ans = 0;
			
			for(int num = A; num <= B; num++) {
				ans += countRecycle(A, num);
			}
				
			System.out.println("Case #"+caseNo+": "+ans);
		}
	}
}