
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.File;
import java.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class RecycledNumbers {
	public static void main(String[] args) throws Exception {
		Scanner sc = new Scanner(new File("resource/input.in"));
		int T = sc.nextInt(); 
		int i = 1;
		while (i<=T) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			System.out.println("Case #"+i+": "+process(A, B));
			i++;
		}
	}
	private static int process(int A, int B) {
		List<String> added = new ArrayList<String>();
		int counter = 0;
		for(int i=A; i<=B; i++){
			String s = i+"";
			for(int j=0; j<s.length()-1; j++){
				char ch = s.charAt(0);
				s = s.concat(ch+"");
				s = s.substring(1, s.length());
				int nx = Integer.valueOf(s);
				if(nx>=A && nx<=B && nx!=i && !added.contains(i+"|"+nx) && !added.contains(nx+"|"+i)){
					counter++;
					added.add(i+"|"+nx);
					added.add(nx+"|"+i);
				}
			}
		}
		return counter;
	}
}
