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.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.util.Scanner;


public class Solution {
	
	public void output(BufferedWriter out, int caseNum, 
			int time) throws IOException
	{
		out.write("Case #" + caseNum + ": " + time + "\n");		
	}
	
	public void solve() throws IOException
	{

		Scanner scan = new Scanner(new File("src/C-small-attempt0.in"));
		BufferedWriter out = new BufferedWriter(new FileWriter
				("C-small-attempt0.out"));

		int cases = scan.nextInt();
		
			for(int i = 1; i <= cases;i++){
					int A = scan.nextInt();
					int B = scan.nextInt();
					int count = 0;
					int j = 0;
					String [] arr = new String[B-A+1];
					
					for(int n = A; n <= B; n++){
						arr[j] = Integer.toString(n);
						j++;
					}
					
					for(int k = 0; k < arr.length; k++){
						for(int l = k+1; l < arr.length; l++){
							int zz = 1;
							int len = arr[k].length();
							while(zz < len){
								if(arr[k].endsWith(arr[l].substring(0, len-zz))){
									if(arr[k].startsWith(arr[l].substring(len-zz))){
										count++;
										break;
									}
								}
								zz++;
							}
						}
					}
					System.out.format("Case #%d: %d\n", i, count);
					output(out, i, count);
			}
		
		out.close();	
	}
	
	public static void main(String[] args) throws IOException
	{
		Solution sol = new Solution();
		sol.solve();
		
	}

}

