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.*;
import java.io.*;

public class Recycler{

	//Vector<int> possibilities = new Vector<int>(0,0);
	private static int[] slider;
	private static String numString;
	private static int rotCounter;
	private static int pairCount;
	private static String elements, toPrint;
	private static int testNum;
	private static Stack stack = new Stack();
	
	
	
	public static void main(String args[]){
		int testCounter = 1;
		System.out.println("working .....");
		try{
		BufferedReader bf = new BufferedReader(new FileReader(args[0]));
		PrintWriter pw = new PrintWriter(new BufferedWriter(new FileWriter("output.out")), true);
		testNum = Integer.parseInt(bf.readLine());
		while((elements=bf.readLine()) != null){
		pairCount = 0;
		int end = Integer.parseInt(elements.split(" ")[1]);
		int start = Integer.parseInt(elements.split(" ")[0]);
		
		START : for (int i = start; i<=end;i++){
			if(Integer.toString(i).length() < 2) continue;
			for(int j=i+1; j<=end; j++){
				stackDigits(j);
				if(stack.search(i%10) == -1){
					stack = new Stack();
					continue;
				}else{
					//System.out.println(i+" "+j+" - "+stack.search(i%10));
					stack = new Stack();
				}
				
				for(int a : rotations(j)){
					if(a == i) pairCount++; //System.out.println("We've got a pair heuston "+i+" "+j);
					}
				
			}
		}
		toPrint = "Case #"+testCounter+": "+pairCount;
		pw.println(toPrint);
		testCounter++;
		}
		}catch(Exception e){
			e.printStackTrace();
		}
		System.out.println("Done!");
	}
	
	private static void stackDigits(int num){
		if(num/10 > 0) stackDigits(num/10);
		stack.push(num%10);
	}
	private static int[] rotations(int num){
		//possibilities.clear();
		numString = Integer.toString(num);
		rotCounter = 0;
		slider = new int[numString.length()];
		
		numString = numString.charAt(numString.length()-1)+numString.substring(0, numString.length()-1);
		slider[rotCounter] = Integer.parseInt(numString);
		
		while(num != slider[rotCounter]){
			rotCounter++;
			numString = numString.charAt(numString.length()-1)+numString.substring(0, numString.length()-1);
			slider[rotCounter] = Integer.parseInt(numString);
		}
		
		return slider;
	}

}