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

}
import java.io.*;
import java.util.Scanner;

public class Main {
	public static void main (String[] args) {
		int i = 1;
		try{
			BufferedReader in = new BufferedReader(new FileReader("input.txt"));
			String ligne;
			ligne = in.readLine();
			ligne = in.readLine();
			while (ligne != null) {
				int res = 0;
				System.out.print("Case #" + i + ": ");
				Scanner sc = new Scanner(ligne);
				int A = sc.nextInt();
				int B = sc.nextInt();
				for (int m=A;m<B;m++){
					for (int n=m+1;n<=B;n++){
						if(recycle(n, m)){
							res++;
						}
					}
				}
				i++;
				System.out.println(res);
				ligne = in.readLine();
			}
			in.close();
		} catch (Exception e){
			System.err.println("Erreur !");
		}
	}

	//prÃ©conditions : a != b a>0 b>0
	public static boolean recycle (int a, int b) {
		long nbDigitsA = Math.round(Math.ceil(Math.log10(a)));
		long nbDigitsB = Math.round(Math.ceil(Math.log10(b)));
		if (nbDigitsA != nbDigitsB || nbDigitsA == 1) {
			return false;
		}
		for (int i=1;i<nbDigitsA;i++){
			String ch_b = "" + b;
			String ch_bTrans = ch_b.substring(i) + ch_b.substring(0, i);
			if (a == Integer.parseInt(ch_bTrans)) {
				return true;
			}
		}
		return false;
	}
}
