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

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Stack;

public class Q3 {
	public static void main(String[] args)throws IOException {
		FileReader buf=new FileReader("C-small.in");
		BufferedReader br=new BufferedReader(buf);
		int cases=Integer.parseInt(br.readLine());
		String[] output=new String[cases];
		for(int i=1;i<=cases;i++){
			int ctr=0;
			String input=br.readLine();
			String[] splits=input.split(" ");
			int A=Integer.parseInt(splits[0]);
			int B=Integer.parseInt(splits[1]);
			for(int n=A;n<=B;n++){
				String temp=n+""+n;
				for(int m=n+1;m<=B;m++){
					String temp2=m+"";
					if(temp.contains(temp2)){
						ctr++;
					}
				}
			}
			if(i!=cases)
			output[i-1]="Case #"+i+": "+ctr+"\n";
			else
			output[i-1]="Case #"+i+": "+ctr;	
		}
		br.close();
		buf.close();
		 FileWriter buf1 = new FileWriter(new File ("C-small_Output.txt"), true);
		 BufferedWriter bw1=new BufferedWriter(buf1);
		for(int i=0;i<cases;i++){
			bw1.write(output[i]);
		}
		bw1.close();
		buf1.close();
	}

}
