package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

//package RecycleNumber;
import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;


public class C {
	public static HashSet<String> hm = new HashSet<String>();
	public static void main(String [] args) throws IOException{
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		int num = Integer.parseInt(in.readLine());
		int count = 1;
		rotate(1234,10,2222);
		while(num-- != 0){
			String [] token = in.readLine().split(" ");
			int num1 = Integer.parseInt(token[0]);
			int num2 = Integer.parseInt(token[1]);
			for(int i = num1; i <= num2; i++){
					rotate(i,num1,num2);
			}
			System.out.println("Case #"+ count++ +": " +hm.size());
			hm.clear();
		}
	
	}
	
	public static void rotate(int current, int num1, int num2){
		int times = (current+"").length()-1;
		int check = current;
		String temp = current+"";
		while(times >= 0 ){
			temp = temp.charAt(temp.length()-1) + temp.substring(0,temp.length()-1);
			times--;
			
			if(Integer.parseInt(temp) > num1 && Integer.parseInt(temp) <= num2 && Integer.parseInt(temp) > check){
				hm.add(check +": "+temp);
				//System.out.println(check + ": " + temp);
			}
			
		}
	
		
	}
}
