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.util.ArrayList;
import java.util.LinkedList;



public class RecycledNumbers {
	public static void solve(String fname) {
		Read r = new Read();
		r.Read(fname);
int numOfTestCases=r.noOfTestCases;
int[] numbers =  r.nums;
String finalAnser="";
for(int i=0;i<numOfTestCases;i++){
	String answer="";
	int firstNum = numbers[2*i];
	int secondNum = numbers[2*i+1];
	int mid = ((secondNum-firstNum)/2)+1;
	int noOfans=0;
	for (int j = firstNum; j < secondNum; j++) {
		String numb = j+"";
//		/LinkedList<Integer> number = new LinkedList<Integer>();	
for (int k = 0; k < numb.length(); k++) {
	String first =  numb.substring(0,k);
	String last =  numb.substring(k,numb.length());
String newNumb = last+first;
int numbC = Integer.parseInt(newNumb);
if((numbC<=secondNum)&&(numbC>j)){
	noOfans++;
}

}

	
		int x=0;
//		int k=0;
//		while(!number.isEmpty()){
//			x=(int) (x+number.removeLast()*Math.pow(10, k));
//			k++;
//		}
		
		
	}
	answer = "Case #"+(i+1)+": "+noOfans;
	finalAnser = finalAnser+answer+"\n";
	
}
r.write("out", finalAnser);
System.out.println(finalAnser);	
	}
	public static void main(String[] args) {
		
	solve("test");
	}
}
