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

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.Map;

public class RecycledNumbersBig {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		Map<Integer, Integer> map = new HashMap<Integer, Integer>();
		int i;
		
		//System.out.println("size of map: " + map.size());
		try{
			
			FileInputStream fstream = new FileInputStream("/Users/mkay/Documents/input_31.txt");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			
			int input1, input2;
			String str1, str2;
			int count = 0,j,m,n,num;
			  while ((strLine = br.readLine()) != null)
			  {
				  //System.out.println (strLine);
				  
				  if(count != 0 )
				  {
					  map = new HashMap<Integer, Integer>();
					  input1 = Integer.parseInt(strLine.split(" ")[0]);
					  input2 = Integer.parseInt(strLine.split(" ")[1]);
					  num=0;
					  
					  for(i=input1;i<input2;i++)
					  {
						 if(i<=99){
							 j=i/10+(i%10)*10;
							 
							 if(j!=i && j>= input1 && j<= input2 && j <= 99 && j > i){
								 num++;
							 }
						 }else if(i<= 999){
							 j=i;
							 for(int k=0;k<2;k++){
								 j=j/10+(j%10)*100;
								 if(j>= input1 && j<= input2 && j!=i && j >= 100 && j>i)
									 num++;
							 }
						 }
						 else if(i<= 9999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<3;k++){
								 j=j/10+(j%10)*1000;
								 if(j>= input1 && j<= input2 && j!=i && j>i){
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
									 //System.out.println(i + " : " + j);
									 
								 }
							 }
						 }
						 else if(i<= 99999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<4;k++){
								 j=j/10+(j%10)*10000;
								 if(j>= input1 && j<= input2 && j!=i && j>i)
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
							 }
						 }
						 else if(i<= 999999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<5;k++){
								 j=j/10+(j%10)*100000;
								 if(j>= input1 && j<= input2 && j!=i && j>i)
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
							 }
						 }
						 else if(i<= 999999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<6;k++){
								 j=j/10+(j%10)*1000000;
								 if(j>= input1 && j<= input2 && j!=i && j>i)
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
							 }
						 }
						 else if(i<= 9999999){
							 j=i;
							 map = new HashMap<Integer, Integer>();
							 for(int k=0;k<7;k++){
								 j=j/10+(j%10)*10000000;
								 if(j>= input1 && j<= input2 && j!=i && j>i)
									 if(!map.containsKey(j)){
										 map.put(j, j);
										 num++;
									 }
							 }
						 }
					  }
					  //1761080
					  //999999
					  //for(Integer k: map.keySet())
						//  System.out.println(k + " : " + map.get(k));
					  //System.out.println("Case #"+ count + ": " + map.size() + " input: " + input1 + " : " + input2 + " num " + num);
					  System.out.println("Case #"+ count + ": " + num);
				  }
				  count++;
				  
			  }			  
			  in.close();
			}catch (IOException e)
		    {
				System.err.println("Error: " + e.getMessage());
		    }		
	}

}