
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 qualification;

import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Scanner;

public class ProblemC {

	/**
	 * @param args
	 */
	public static String input = "C-small-attempt0.in";
	public static HashSet<Integer> testSet;
	public static void main(String[] args) throws IOException {
		// TODO Auto-generated method stub
		//Scanner in = new Scanner(System.in);
		Scanner in = new Scanner(new FileReader(input));
		int t = in.nextInt();
		PrintWriter out = new PrintWriter(new FileWriter("out"));
		for (int test = 0; test < t; test++) {
			testSet = new HashSet<Integer>();
			int a = in.nextInt();
			int b = in.nextInt();
			int result = 0;
			for(int number = a; number<=b;number++){
				String s = Integer.toString(number);
				int length = s.length();
				if(length<=1){
					continue;
				}
				int bigPow = (int) Math.pow(10, length-1);
				int pow = 1;
				for(int i = s.length()-1; i>=1;i--){
					String partOne = s.substring(i);
					String partTwo = s.substring(0,i);
					int partOneNumber = Integer.parseInt(partOne);
					int partTwoNumber = Integer.parseInt(partTwo);
					int newNumber = partOneNumber*bigPow/pow+partTwoNumber;
					if(newNumber>=a&&newNumber<=b){
						if(newNumber > number){
							result++;
						}
					}
					pow*=10;
				}
				
			}
			out.println("Case #"+(test+1)+": "+result);
			out.flush();
		}
		out.close();
	}

}
