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.FileReader;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

public class RecycledNumbers {

	public static void main(String[] args) throws IOException {
		String msg = "";
		BufferedReader br = null;
		String sCurrentLine = null;
		Map<String, String> map = new HashMap<String, String>();
		br = new BufferedReader(new FileReader("test"));
		sCurrentLine = br.readLine();
		int x = 0;
		if (sCurrentLine != null) {
			while ((sCurrentLine = br.readLine()) != null) {
				int sum = 0;
				msg = "";
				x++;
				int a = Integer.parseInt(sCurrentLine.split(" ")[0]);
				int b = Integer.parseInt(sCurrentLine.split(" ")[1]);
				for (int n = a; n < b; n++) {
					// for (int m = n + 1; m <= b; m++) {
					sum += fetchUniquePairs(n, a, b);
					// }
				}
				msg += "Case #" + x + ": " + sum;
				System.out.println(msg);
			}
		}

	}

	private static int fetchUniquePairs(int n, int a, int b) {
		List<Integer> uniquePairs = new ArrayList<Integer>();
		int dupN = n;
		int i = 0;
		while (dupN > 0) {
			dupN = dupN / 10;
			i++;
		}
		dupN = n;
		for (int j = 0; j < i - 1; j++) {
			int mod = dupN % 10;
			int add = mod * (int) Math.pow(10, i - 1);
			dupN = (dupN / 10);
			dupN += add;
			if (dupN <= b && dupN > n)
				if (!uniquePairs.contains(dupN))
					uniquePairs.add(dupN);
		}
		return uniquePairs.size();
	}
}
