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.*;
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;
	}
}
