import java.util.Scanner;
import java.io.*;
import java.lang.Math;


public class C{
	public static int recycle(String str){
		String[] numbers = str.split(" ");
		int min = Integer.parseInt(numbers[0]);
		int max = Integer.parseInt(numbers[1]);
		int ret = 0;

		for(int i = min; i < max; i++){
			String num = i + "";
			int len = num.length();
			int k = i;
			for(int j = 1; j < len; j++){
				k = (k/10) + (int)java.lang.Math.pow(10.0,(double)(len-1))*(k%10);
				if (k > i && k <= max)
					ret++;
				else if(k == i)
					break;
			}
		}

		return ret;
	}

	public static void main(String[] args){
		Scanner sc = null;
		String next;
		int out;
		try{
			sc = new Scanner(new File("C-large.in"));
			int cases = Integer.parseInt(sc.nextLine());
			int current = 0;
			

			FileWriter fs = new FileWriter("output.txt");
			BufferedWriter buff = new BufferedWriter(fs);
			while(current < cases){
				next = sc.nextLine();
				current++;
				out = recycle(next);
				buff.write("Case #" + current + ": " + out + "\n");
			}
			buff.close();
		}
		catch(Exception ex){}
	}
}
package com.gzroger.codejam2012;

import java.io.BufferedReader;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;
import java.util.StringTokenizer;

public class QC {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try {
			BufferedReader reader = new BufferedReader(new FileReader(args[0]));
			int nCases = Integer.parseInt( reader.readLine() );
			for (int iCases=0; iCases<nCases; iCases++) {
				String stLine = reader.readLine();
				int A, B;
				StringTokenizer st = new StringTokenizer(stLine);
				A = Integer.parseInt( st.nextToken() );
				B = Integer.parseInt( st.nextToken() );
				System.out.println("Case #"+(iCases+1)+": "+ possible(A, B));
			}
			
		} catch (FileNotFoundException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (NumberFormatException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}

	}

	private static long possible(int A, int B) {
		int cPos = 0;
		int N = 0;
		int Z = A;
		while (Z>=1) {
			Z = Z/10;
			N++;
		}
		
		for (int n=A; n<=B; n++) {
			Set<Integer> hmInt = new HashSet<Integer>();
			for (int j=1; j<N; j++) {
				int m = n%I[j]*I[N-j] + n/I[j];
				if (n<m && m<=B && !hmInt.contains(m)) {
					cPos ++;
					hmInt.add(m);
				}
			}
		}
		return cPos;
	}

	
	static int[] I = new int[8];
	static {
		int n = 1;
		for (int i=0; i<I.length; i++) {
			I[i] = n;
			n*=10;
		}
	}
}
