import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;

public class Recycled {
	public static void main(String[] args) throws Exception{
		String inputFile = "C-small-attempt0.in";
		
		BufferedReader input = new BufferedReader(new InputStreamReader(new FileInputStream(inputFile)));
		BufferedWriter output = new BufferedWriter(new OutputStreamWriter(new FileOutputStream("output")));
		long num_cases = Long.parseLong(input.readLine());
		int current_case = 0;
		
		while (current_case < num_cases){
			current_case++;
			
			String[] fields = input.readLine().split(" ");
			int A = Integer.parseInt(fields[0]);
			int B = Integer.parseInt(fields[1]);
			int total = 0;
			
			for (int n = A; n < B; n++){
				for (int m = n+1; m <= B; m++){
					if (isRecycled(n,m)) total++;
				}
			}
			
			System.out.println("Case #" + current_case + ": " + total);
			output.write("Case #" + current_case + ": " + total + "\n");
		}
		output.close();
	}

	private static boolean isRecycled(int n, int m) {
		String sn = ""+n;
		String sm = ""+m;
		if (sn.length() != sm.length()) return false;
		int totaln = 0, totalm = 0;
		for (int i = 0; i < sn.length(); i++){
			totaln += sn.charAt(i);
			totalm += sm.charAt(i);
		}
		if (totaln != totalm) return false;
		for (int i = 0; i < sn.length()-1; i++){
			sm = sm.charAt(sm.length() - 1) + sm.substring(0, sm.length() - 1);
			if (sm.equals(sn)) return true;
		}
		return false;
	}
}

import java.util.Scanner;

/**
 * author - coolprosu
 * Problem - C
 */

public class RecycledNumbers {
	private int T = 0;
	public static void main(String[] args) {
		RecycledNumbers solveProb = new RecycledNumbers();
		solveProb.solve();
	}
	private void solve() {
		Scanner sc = new Scanner(System.in);
		//Input no. of test cases
		T = sc.nextInt();
		//Solved strings
		String solutionArray[] = new String[T];	
		for(int i=0;i<T;i++) {
			solutionArray[i] = "Case #"+(i+1)+": ";
			int A = sc.nextInt();
			int B = sc.nextInt();
			int recyclePairCount = 0;
			for(int n=A;n<B;n++) {
				for(int m=n+1;m<=B;m++) {
					recyclePairCount+=countRecyclable(n,m);
				}
			}
			solutionArray[i] += recyclePairCount;
		}
		//Output result
		for(int i=0;i<T;i++) {
			System.out.println(solutionArray[i]);
		}			
	}
	private int countRecyclable(int a, int b) {
		String str1 = ""+a;
		String str2 = ""+b;
		if(str1.length()!=str2.length())
			return 0;
		int totalCombinations = 0;
		for(int i=1;i<str1.length();i++) {
			//String operation calculation
			if(str2.equals(str1.substring(i,str1.length())+str1.substring(0,i)))
				totalCombinations++;
			//Mathematical calculation
			/*int takenOut = a%((int)Math.pow(10,i));
			int previousPart = (int)a/(int)Math.pow(10,i);
			int multiplier = (int)Math.pow(10,(str1.length()-i));
			int finalInt = takenOut*multiplier + previousPart; 
			if(b==finalInt)
				totalCombinations++;*/
		}
		return totalCombinations;
	}
}
