import java.io.*;

class code1
{
	public static void main(String args[]) throws Exception 
	{
		File ii = new File ("C-small-attempt1.in");
		FileInputStream fis = new FileInputStream(ii);
		BufferedReader  br = new BufferedReader(new InputStreamReader (fis));
		int cases = Integer.parseInt(br.readLine());
		FileOutputStream fout = new FileOutputStream ("output.txt");
		DataOutputStream dout = new DataOutputStream (fout);
		int total=0;
		for(int i=0;i<cases;i++){
		String temp = br.readLine();
		String parts [] = temp.split(" ");
		int lower = Integer.parseInt(parts[0]);
		int upper = Integer.parseInt(parts[1]);
		System.out.println(lower+" "+upper);
		
		for(int j=lower;j<=upper;j++)
		{
			int abc = j;int length=0;
			if(j<10)continue;
			while (abc!=0){abc/=10;length++;}
			abc=j;
			for(int m=0;m<length-1;m++){
				int shift = abc%10;
				abc=abc/10;
				System.out.println("hi "+j);
				abc=abc+shift*power(10,length-1);
				if(abc<=upper&&shift!=0&&abc>j)total++;
				System.out.println(total);
			}
		}
 		dout.writeBytes("Case #"+(i+1)+ ": "+total+"\n");
 		total=0;
		}//for close
		
	}

	private static int power(int i, int j) {
		int no=1;
		for(int a=0;a<j;a++){no=10*no;}
		return no;
	}
}
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Hashtable;
import java.util.Scanner;

import com.sun.org.apache.xpath.internal.operations.Bool;


public class ProbC {

	static Hashtable<Integer, Hashtable<Integer, Boolean>> vis;
	public static void main(String[] args) {
		PrintWriter out;
		try {
			out = new PrintWriter(new FileWriter("d:\\codejam2012\\outputfile.txt"));
			Scanner scanner = new Scanner(new File("d:\\codejam2012\\C-small-attempt0.in"));
			
			int cases = scanner.nextInt();
			scanner.nextLine();
			
			for (int i = 1; i <= cases; i++) {
				int a = scanner.nextInt(), b = scanner.nextInt();
				vis = new Hashtable<Integer, Hashtable<Integer, Boolean>>();
				int sol = 0;
				for (int j = a; j < b + 1; j++) {
					sol += getPairs(j, a, b);
				}
				out.println("Case #"+i+": " +sol);
			}

			out.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		} 
		
	}

	private static int getPairs(int n, int a, int b) {
		String str = "" + n;
		int count = 0;
		
		for (int i = 1; i < str.length(); i++) {
			int div = (int) Math.pow(10, i);
			int shift = (int) Math.pow(10, str.length() - i);
			int m = (n%div) * shift + (n / div);
			if(m >= a && m <= b && Integer.toString(n).length() == Integer.toString(m).length() && n != m){
				if(vis.containsKey(n) && vis.get(n).containsKey(m))
					continue;
				count++;
				
				if(!vis.containsKey(n))
					vis.put(n, new Hashtable<Integer, Boolean>());
				
				vis.get(n).put(m, true);
				
				if(!vis.containsKey(m))
					vis.put(m, new Hashtable<Integer, Boolean>());
				
				vis.get(m).put(n, true);
			}
		}
		return count;
	}

}
