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.*;

class p3
{
	public static void main(String s[])
	{
		int startingnum;
		int endingnum;
		int totalcases;
		int pairs;
		try{
			File f = new File("C-small-attempt0.in");
			File o = new File("Output.out");
			String strLine=null;
			int first=1;

			BufferedReader br = new BufferedReader(new FileReader(f));
			PrintWriter out = new PrintWriter(new FileWriter(o));
			 
			strLine = br.readLine();
			totalcases=Integer.parseInt(strLine);
			
			for(int i=0; i<totalcases; i++)	
			{
				strLine = br.readLine();
				String nums[]=strLine.split(" ");
				startingnum=Integer.parseInt(nums[0]);
				endingnum=Integer.parseInt(nums[1]);
//				System.out.println("Start:"+startingnum+" End:"+endingnum);
				pairs=findPairs(startingnum,endingnum,out);
//				if(first==1)
//				{
					out.println("Case #"+(i+1)+": "+pairs);
//					first=0;
//				}
//				else if(first==0)
//					out.println("\n"+"Case #:"+i+": "+pairs);
			}
			br.close();
			out.close();
		}catch (Exception e)
		{//Catch exception if any
		System.err.println("Error: " + e.getMessage());
		}
	}
	
	
	static int findPairs(int startingnum, int endingnum, PrintWriter out)
	{
		int currentnum=startingnum;
		int pairs=0;
		ArrayList<String> arl = new ArrayList<String>();
		
		for(currentnum = startingnum; currentnum <= endingnum; currentnum++)
		{
//			System.out.println();
			String curr=currentnum+"";
			String rotatednum=null;
			
			try{		
				for(int i=0; i<curr.length()-1; i++)
				{
					if(curr.charAt(curr.length()-1)=='0')
						continue;
					rotatednum=curr.substring(0,curr.length()-1);
					rotatednum=curr.substring(curr.length()-1,curr.length())+rotatednum;
//					System.out.println("Currentnum:"+currentnum+" Trying for:"+rotatednum);
					if( (Integer.parseInt(rotatednum) )>startingnum && ( Integer.parseInt(rotatednum) )<endingnum)
					{
						if(arl.indexOf(currentnum+" "+rotatednum)== -1 && arl.indexOf(rotatednum+" "+currentnum)== -1 && currentnum != Integer.parseInt(rotatednum))
						{
//							out.println("Pair Found for:"+currentnum+" and "+rotatednum);
							arl.add(currentnum+" "+rotatednum);
							pairs++;
						}
					}
					curr=rotatednum;
				}
			}catch(Exception e)	{
			}

		}
		return pairs;
	}
}
