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.FileWriter;
import java.io.IOException;
import java.util.Scanner;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.FileReader;
import java.io.PrintStream;
import java.io.PrintWriter;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.io.IOException;
import java.util.Arrays;


public class Recycled {


	public static void main(String args[]) throws IOException
	{
		try
		{
			PrintWriter wt= new PrintWriter("C:\\Documents and Settings\\windows\\workspace\\test\\src\\file.out.txt");
			Scanner I = new Scanner(new File("C:\\Documents and Settings\\windows\\workspace\\test\\src\\C-small-attempt0.in"));
			String num = I.nextLine();
			int numTests = Integer.parseInt(num);

			for(int x=0; x<numTests; x++)
			{
				int a = I.nextInt();
				int b = I.nextInt();
				int count = 0;
				int arr[] = new int[b-a+1];

				for(int z = 0; z<(b-a+1); z++)
				{  arr[z] = a + z;
				;
				}

				for( int i = 0; i < (b-a+1); i++)
				{
					for(int j = i; j < (b-a+1); j++)
					{
						if( (arr[i] < arr[j]) && (i != j))
						{
							if (isRecycled(arr[i],arr[j])== true)
								count = count + 1;	 

						} 	
					}
				}
				//logic to write result to file
				String finalResult = "Case #"+(x+1)+": "+count;
				wt.println(finalResult);
			}
			wt.close();
			I.close();
		}
		catch(FileNotFoundException e)
		{
			e.printStackTrace();
		}

		catch(IOException e)
		{
			System.out.println(e);
		}
	}


	// Replacement algorithm
	public static boolean isRecycled(int a, int b)
	{  
		//also need to check for size of a and b ?? not needed if we directly compare


		String strA = Integer.toString(a);
		String strB = Integer.toString(b);
		String newStr = null;
		for (int i = 0; i<strB.length(); i++)
		{   
		    newStr = movedFirstToLast(strB);
		    strB = newStr;
			if(strA.equals(newStr))
			{
				return true;
			}
		}		  	
		return false;

	} 


	public static String movedFirstToLast(String a)
	{
		String newString = null;
		String firstChar = a.substring(0,1);
		newString = a.substring(1); // except first character
		newString = newString + firstChar;
        return newString;
	}


}		 

