
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.io.File;
import java.io.IOException;
import java.io.FileWriter;
import java.io.BufferedWriter;

public class Recycle
{
	public static void main(String[] args)
	{
/*		Set<Integer> perms = getPermutations(123456);
		
		for(Integer i: perms)
			System.out.println(i);*/
	
		try
		{
			Scanner s = new Scanner(new File("recycle.in"));
			BufferedWriter w = new BufferedWriter(new FileWriter(new File("recycle.out")));
			int numCases = s.nextInt();
			s.nextLine();
			
			for(int n = 1;n <= numCases; n++)
			{
				int A = s.nextInt();
				int B = s.nextInt();
				int count = 0;
				for(int k = A; k <= B; k++)
				{
					count += getNumPairs(k, B);
				}
				
				w.write("Case #" + n + ": " + count + "\n");
			}
			
			w.flush();
			w.close();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}
	
	public static int getNumPairs(int n, int B)
	{
		Set<Integer> possibles = getPermutations(n);
		int count = 0;
		for(Integer i : possibles)
			if(i > n && i <= B)
				count++;
		return count;
	}
	
	public static Set<Integer> getPermutations(int n)
	{
		Set<Integer> perms = new TreeSet<Integer>();
		char[] digits = String.valueOf(n).toCharArray();
		
		for(int firstPos = 1; firstPos < digits.length; firstPos++)
		{
			String toBuild = "";
			for(int k = 0; k < digits.length; k++)
				toBuild += digits[(firstPos + k) % digits.length];
			perms.add(Integer.parseInt(toBuild));
		}
		return perms;
	}
	

}
package codejam12;

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStreamReader;

public class RoundOneProblemC {

	/**
	 * @param args
	 * @throws IOException 
	 */
	public static void main(String[] args) throws IOException {
		
		BufferedReader input = new BufferedReader(new FileReader("input.txt"));
		BufferedWriter output = new BufferedWriter(new FileWriter("output.txt"));
		
		int noOfTestCases = Integer.parseInt(input.readLine());
		
		for(int i=1;i<=noOfTestCases;i++)
		{
			String inputLine = input.readLine();
			String strArr[] = inputLine.split("\\s+");
			int a = Integer.parseInt(strArr[0]);
			int b = Integer.parseInt(strArr[1]);
			
			String bStr = Integer.toString(b);
			
		    char firstBDigit = bStr.charAt(0);
			
			int no = 0;
			for(int num=a;num<=b;num++)
			{
				String numStr = Integer.toString(num);
				
				char firstChar = numStr.charAt(0);
				
				//if(firstChar == firstBDigit)
					//continue;
				
				for(byte k=1;k<numStr.length();k++)
				{
					if(numStr.charAt(k)>=firstChar && numStr.charAt(k)<=firstBDigit)
					{
						int newNumber = Integer.parseInt(numStr.substring(k) + numStr.substring(0,k));
						
						if(newNumber <= b && newNumber > num)
						{
							
							no++;
						}
						
						
					}
				}
				
			}
			
			output.write("Case #" + i + ": " + no + "\n");
		}
		
		input.close();
		output.close();

	}
	
	
}
