import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.util.StringTokenizer;

class RecycledNumbers{
	
	
	
	int getcount(int small,int large){
		int count = 0;
		for(int currnum = small; currnum < large; currnum++){
			int permut = currnum;
			int no_of_digits = 0;
			while(permut > 0){
				permut = permut/10;
				no_of_digits++;
			}
			int lastDigit = currnum % 10;
			permut = currnum / 10;
			permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
			while(permut != currnum){
				
				if(permut >= currnum && permut <= large){
					
					count++;
				}
				lastDigit = permut % 10;
				permut = permut / 10;
				permut = permut + lastDigit * (int)Math.pow(10, no_of_digits-1);
				
			}
			
		}
		
		return count;
	}
	
	public static void main(String args[]){
		RecycledNumbers d = new RecycledNumbers();
		
		int no_of_cases = 0;
		String input = "";
		
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		try{
			no_of_cases = Integer.parseInt(br.readLine());
		}
		catch(Exception e){
			System.out.println("First line is not a number");
		}
		
		for(int i=1; i <= no_of_cases;i++){
			try{
				input = br.readLine();
			}
			catch(Exception e){
				System.out.println("Number of test cases different from the number mentioned in first line");
			}
			
			System.out.print("Case #" +i+": ");
			
			StringTokenizer t =  new StringTokenizer(input);
			int small=0,large=0;
			if(t.hasMoreTokens()){
				small = Integer.parseInt(t.nextToken());
			}
			if(t.hasMoreTokens()){
				large = Integer.parseInt(t.nextToken());
			}
			System.out.println(d.getcount(small,large));
			
		}
		
		
		

	}
	
	
}
import java.io.*;
import java.util.*;
import java.lang.*;
class Source2 
{
	public static void main(String[] args) throws IOException 
	{
		String s,word,buffer;
		 FileReader input = new FileReader("C-small.in");
		 BufferedReader in = new BufferedReader(input);
		File file = new File("C-small.out");
		BufferedWriter out = new BufferedWriter(new FileWriter(file));

			s = in.readLine();
		int count= Integer.parseInt(s);

		int i=1;
		 while ((s = in.readLine()) != null && s.length() != 0)
		{
			 out.write("Case #"+(i++)+": ");
				Scanner scan =new Scanner(s);
				buffer="";
			
			
				long A =Integer.parseInt(scan.next());
				long B = Integer.parseInt(scan.next());
			
				
				long ans = calculatemn(A,B);


				out.write(ans+"\n");
		}


		 out.close();
	}


	public static long calculatemn(long A,long B)
	{
		long[][] recyclepair =new long[2000000][2];
		long count=0;
		boolean check=false;
		int re_i=0;

		for(long n=A ;n<=B;n++)
		{
			check=true;
			String stn =n+"";
			String stm =n+"";
			int length =stn.length();

			for(int i=1;i<length;i++)
			{
				stm = recycle(stn,i);
				
				
				long N= Long.parseLong(stn);
				long M =Long.parseLong(stm);

			
				if(M>N&&M<=B)
				{
					boolean pass =true;
					for(int j=0;j<re_i;j++)
					{
						if(recyclepair[j][0]==N&&recyclepair[j][1]==M)
						{
							pass=false;
						}
					}




					if(pass)
					{
					count++;

					recyclepair[re_i][0] =N;
					recyclepair[re_i][1] =M;
					re_i++;
					check=false;
					}
				}
			}

		}
		return count;
	}

	public static String recycle(String stn,int num)
	{

		String last = stn.substring(stn.length()-num,stn.length());

		String first =  stn.substring(0,stn.length()-num);

		return last+first;
	}
}
