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.util.*;


import java.util.*;
public class soalC{

	public static void main(String[] args){
			Scanner scan=new Scanner(System.in);



			int tc = scan.nextInt();

			for (int i = 0 ; i <  tc; i++)
			{
				int awal = scan.nextInt();
				int akhir = scan.nextInt();

				int index = awal;
				int count = 0;

				for (int j = awal; j <= akhir ; j++)
				{
					for (int k = j+1; k <= akhir ; k++)
					{
						if (checkRecycle(j,k))
						{
							count++;
						}

					}

				}

				System.out.println("Case #"+(i+1)+": "+count);


			}
	}

	public static boolean checkRecycle(int m, int n)
	{
		String x = n+"";
		for (int i = 0 ; i < x.length() ; i++)
		{
			if (Integer.parseInt(x.substring(i,x.length())+(x.substring(0,i)))==m)
			{
				return true;
			}
		}


		return false;
	}

}



