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;
	}

}


import java.io.*;

public class pro3 {

private static BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

public static void main ( String [] args ) throws IOException
{
int N = Integer.parseInt(br.readLine());

for(int i = 0;i < N; i++)
System.out.println("Case #" + (i+1) + ": " + cal());
}

private static String cal() throws IOException {
	int start;
	int end;
	int lenth;
	int count=0;
	
	String[] buffer = br.readLine().split("\\s");
	
	start=Integer.parseInt(buffer[0]);
	end=Integer.parseInt(buffer[1]);
	
	lenth=Integer.toString(start).length();
	
	String digit= new String();
	String tempdigit=new String();
	
	for(int i=start;i<=end;i++){
		digit=Integer.toString(i);
		
		
		for(int j=1;j<lenth;j++){
			tempdigit=digit.substring(j).concat(digit.substring(0,j));
			if(Integer.parseInt(tempdigit)<=end
			   && Integer.parseInt(tempdigit)>=start){
				if(digit.compareTo(tempdigit)==0)
					break;
				/*System.out.println("digit "+digit);
				System.out.println("tempdigit"+tempdigit);
				*/count++;
			}
		}
			
		}
		

	
	

return Integer.toString(count/2);
}

}