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.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;


public class RecycledNumbers {


	private static FileReader freader;
	private static BufferedReader buffreader;
	private static FileWriter fwriter;
	private static BufferedWriter buffwriter;
	
	public static void main(String[] args) throws IOException {
		
		freader = new FileReader("C-small-attempt0.in");
		buffreader = new BufferedReader(freader);
		fwriter= new FileWriter("result.txt");
		buffwriter = new BufferedWriter(fwriter);
		String str = null;
		int linenum = 0;
		int i=1;
		while((str=buffreader.readLine())!=null){
			if(i==1)
				linenum=Integer.parseInt(str);
			else{
				int start = Integer.parseInt(str.split(" ")[0]);
				int end = Integer.parseInt(str.split(" ")[1]);
				int num = calRecycleNum(start, end);
				String finalStr = "Case #"+Integer.toString(i-1)+": "+Integer.toString(num)+"\n";
				buffwriter.write(finalStr);
			}
			i++;
		}
		buffwriter.close();
		fwriter.close();
		buffreader.close();
		freader.close();

	}
	
	public static int calRecycleNum(int start, int end){
		int num = 0;
		for(int i=start; i<=end; i++){
			int len = Integer.toString(i).length();
			int recycleVal = i;
			HashSet<Integer> targetSet = new HashSet<Integer>();
			for(int j=1; j<len; j++){
				recycleVal = recycleOnce(recycleVal,len);
				if(recycleVal<=i)
					continue;
				else if(recycleVal<=end && recycleVal>=start){
					if(!targetSet.contains(recycleVal)){
						num++;
						//System.out.println(i+"\t"+recycleVal);
						targetSet.add(recycleVal);
					}
					/*else{
						System.out.println("Duplicate:"+recycleVal+"\t"+i);
					}*/

				}
				
			}
		}
		//System.out.println(num);
		return num;
	}
	
	public static int recycleOnce(int val, int length){
		return (int) (val%Math.pow(10, length-1)*10+val/Math.pow(10, length-1));
	}

}
