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.codejam.googlearse;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.HashSet;

public class Problem3 {

	
	public static void main(String arg[])
	{
		

	
	 try{
         FileInputStream fstream = new FileInputStream("textfile.txt");
         DataInputStream in = new DataInputStream(fstream);
         BufferedReader br = new BufferedReader(new InputStreamReader(in));
         
         FileWriter foutstream = new FileWriter("test1.out");
         BufferedWriter out = new BufferedWriter(foutstream);
         
         
         String strLine, copyStrLine = "";
         int caseCount = -1;
         strLine = br.readLine();
         caseCount = Integer.parseInt(strLine);
         for(int j=0; j < caseCount; j++)
                 //System.out.println (strLine);
         {
        	 strLine = br.readLine();
        	 String[] splitStrings = strLine.split(" ");
        	 int A = Integer.parseInt(splitStrings[0]);
        	 int B = Integer.parseInt(splitStrings[1]);
        	 int recycleCount = 0;
        	 for(int n = A; n < B; n++)
        	 {
        		int count = 10 ;
        		int counter = 0;
        		int len = splitStrings[1].length()-1;
        		int  arrayNumbers[];
        		
        		HashSet hashSet = new HashSet();
        		while(counter < len)
        		{
        			int tail = n % count;
        			int front = n / count;
        			
        			count = count * 10 ;
        			int val = (int) Math.pow(10,(len - counter));
        			int m = tail * val + front;
        			//System.out.println(i+":"+":"+temp+":"+val);
        			if(m > A && m <= B && m > n)
        			{
        				hashSet.add(new Integer(m));
        			}
        			counter++;
        		}
        		recycleCount = recycleCount + hashSet.size();
        	 }
        	 System.out.println(recycleCount);
           
           	out.write("Case #" + (j + 1) + ": " + recycleCount + "\n");
         
         }
         out.close();
	 	} 
	 catch (Exception e) {
         System.err.println("Error: " + e.getMessage());
 
	   }
	}
}
