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.*;
public class CodeJamQual3b {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		 try{
			// Open the file that is the first 
			// command line parameter
			File file = new File("input.in");
			FileInputStream fstream = new FileInputStream("input.in");  //Input file name changed to input.in
			// Get the object of DataInputStream
			DataInputStream in = new DataInputStream(fstream);
	        BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			FileWriter fout = new FileWriter("out3.txt");
			BufferedWriter outprint = new BufferedWriter(fout);
			//Read File Line By Line
			int i = 0;
			while (((strLine = br.readLine()) != null)) 	{
				if (i != 0 && i !=1111) {
					String[] stringArray = strLine.split(" ");
					
					int bot = Integer.parseInt(stringArray[0]);
					int top = Integer.parseInt(stringArray[1]);
					int counter = 0;
					int len = stringArray[0].length(); 
					//top
					for (int j = bot; j < top+1; j++) {
						counter = counter + count(j,top,bot,len);
						//System.out.println("j = " + j + "  " + count(j,top,bot));
					}
					//System.out.println (counter);
					
					outprint.write("Case #" + i + ": " + counter);
					outprint.newLine();
					System.out.println("Case #" + i + ": " + counter);
				}				
				i++;
			}
			
			//Close the input stream
			in.close();
			//Close the output stream
			outprint.close();
		}catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}
	
	public static int count(int j, int top, int bot, int len){
		char[] cArray = Integer.toString(j).toCharArray();
		int out = 0;
		int[] log = new int[len];
		for (int k = 0; k < len-1; k++) {
			cArray = shift(cArray);
			boolean flag = true;
			//System.out.println(new String(cArray));
			int recycled = Integer.parseInt(new String(cArray));
			if ((j <recycled) && (recycled > bot) && (recycled <= top)){
				//System.out.println("(" + j + " , " + recycled + ")" + " [ " + bot + " |" + top + " ] ");
				for (int in = 0; in < len; in++){
					if (recycled == log[in]){
						flag = false;
						//System.out.println("REPEAT" + recycled);
						break;
					}
				}
				if (flag == true){
					log[k] = recycled;
					//System.out.println("(" + j + " , " + recycled + ")" + " [ " + bot + " |" + top + " ] ");
					out += 1;
				}
			}
				
		}
		return out;
	}
	
	public static char[] shift(char[] cArray) {
	    char[] nArray = new char[cArray.length];
	    nArray[0] = cArray[cArray.length-1];
	    for (int d = 1; d < cArray.length; d++){
	    	nArray[d] = cArray[d-1];
		}
		return nArray;
	}
}
