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.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintStream;
import java.util.HashSet;
import java.util.Set;


public class Recycle {
	
	public static void main(String[] args) throws IOException {
		long time = System.currentTimeMillis();
		File iFile = new File("A-large-practice.in");
		BufferedReader in= new BufferedReader(new FileReader(iFile));
		
		File oFile = new File("A-large-practice.out");
		FileOutputStream fos = new FileOutputStream(oFile);
		BufferedOutputStream bos = new BufferedOutputStream(fos);
		PrintStream out = new PrintStream(bos);
			
		int numCases = Integer.parseInt(in.readLine());
		
		for(int i=0; i<numCases; i++){
			String[] inputString = in.readLine().split(" ");
			int A = Integer.parseInt(inputString[0]);
			int B = Integer.parseInt(inputString[1]);
			
			int result = recycle(A, B);
			
			System.out.println("Case #"+(i+1)+": "+result);
			out.println("Case #"+(i+1)+": "+result);
		}
		
		
		long duration = System.currentTimeMillis() - time;
		System.out.println(duration+"ms taken");
		out.close();
	}
	
	private static int recycle(int A, int B){
		int result = 0;
		
		for(int i=A; i<B; i++){
			result += recycleNumber(i, B);
		}
		return result;
	}
	
	private static int recycleNumber(int i, int B){
		String iRep = Integer.toString(i);

		Set<String> possibleMs = new HashSet<String>();
		for(int rotate=1; rotate<iRep.length(); rotate++){
			String thisRot = iRep.substring(rotate)+ iRep.substring(0, rotate);
			int thisNum = Integer.parseInt(thisRot);
			if(thisNum > i && thisNum<=B){
				possibleMs.add(thisRot);
			}
		}
		
		return possibleMs.size();
	}
}