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

import java.io.*;
import java.util.*;
public class Entry {

	private static ArrayList<Integer> cases=new ArrayList<Integer>();
	
	public static void main(String args[]) throws IOException
	{
		FileReader src=new FileReader("test.txt");
		FileWriter f=new FileWriter("output.txt");
		BufferedWriter out=new BufferedWriter(f);
		Scanner in=new Scanner(src);
		int iterate=in.nextInt();
		int i,j;
		int A,B;
		int n,m;
		
		HashSet<Double> dub=new HashSet<Double>();
		for(i=0;i<iterate;i++)
		{
			A=in.nextInt();
			B=in.nextInt();
			n=A;
			while(n< B)
			{
				for(j=1;j<Integer.toString(n).length();j++)
				{
					m=reverse(n,j);
					if((A<=n)&& (n<m) &&(m<=B) &&(m!=n))
					{
						dub.add((n*Math.pow(10,Integer.toString(n).length()))+m);
					}
				}
				n++;
			}
			cases.add(dub.size());
			dub.clear();
			
		}
		
		int index=1;
		for(int str:cases)
		{
			out.write(("Case #"+index+":\t"+str));
			out.write("\n");
			index++;
		}
		out.close();
		in.close();
	}
	
   
	private static int reverse(int n,int j)
	{
		String str=Integer.toString(n);
		String ans=str.substring(str.length()-j);
		String ans2=str.substring(0,str.length()-j);
		str=ans+ans2;
		int m=Integer.valueOf(str);
		return m;
	}
	
}
