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;

public class RecycledNumbers {
	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int n = scan.nextInt();
		int[] array = new int[n];
		for (int i = 0; i < n; i++) {
			int min = scan.nextInt();
			int max = scan.nextInt();

			int total = 0;
			for (int j = min; j <= max; j++)
				for (int k = j+1; k <= max; k++)
					if (isR(j, k))
						total++;
			array[i] = total;
		}
		for (int i = 1; i <= n; i++)
			System.out.println("Case #" + i + ": " + array[i - 1]);
	}

	private static boolean isR(int m, int n) { 
		if(m<10){
			return false;
		}
		else if(m<100){
			return isR(m,n,2);
		}
		else if(m<1000){
			return isR(m,n,3);
		}
		else if(m<10000){
			return isR(m,n,4);
		}
		else if(m<100000){
			return isR(m,n,5);
		}
		else if(m<1000000){
			return isR(m,n,6);
		}
		else if(m<10000000){
			return isR(m,n,7);
		}
		else return false;
	}

	private static boolean isR(int m, int n, int i) {
		boolean tf=false;
		for(int j=1;j<i;j++){
			int big=m/(int)Math.pow(10, j);
			int rem=m%(int)Math.pow(10, j);
			int mm=big+rem*(int)Math.pow(10, i-j);
			tf=tf||mm==n;
		}return tf;
	}
}
