
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.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;


public class RecycledNumbers {
	
	public static File input;
	public static FileReader inputReader;
	public static BufferedReader in;
	
	public static File output;
	public static FileWriter outputWriter;
	public static BufferedWriter out;
	
	private static void init(String problemName) throws IOException {
		input = new File(problemName+".in");
		inputReader = new FileReader(input);
		in = new BufferedReader(inputReader);
		
		output = new File(problemName+".out");
		outputWriter = new FileWriter(output);
		out = new BufferedWriter(outputWriter);
	}
	
	public static int INT() throws IOException {
		return Integer.parseInt(in.readLine());
	}
	
	public static String LINE() throws IOException {
		return in.readLine();
	}
	
	public static void main(String[] args) throws IOException {
		init("recycled-numbers");
		
		int cases = INT();
		for(int i = 1; i <= cases; i++) {
			String[] bounds = LINE().split("\\s");
			int A = Integer.parseInt(bounds[0]);
			int B = Integer.parseInt(bounds[1]);
			
			Set<String> pairs = new HashSet<String>();
			
			for(int x = A; x<=B; x++) {
				String n = String.valueOf(x);
				int digits = n.length();
				if(digits > 1) {
					for(int p = 1; p < digits; p++) {
						String m = n.substring(n.length()-p)+n.substring(0,n.length()-p);
						int mN = Integer.parseInt(m);
						if(m.startsWith("0") || !(mN >= A && mN <=B)){
							continue;
						} else {
							if(x < mN){
								pairs.add("("+n+","+m+")");
							}
						}
					}
				}
			}
			
			System.out.println("Case #"+i+": "+pairs.size());
			out.write("Case #"+i+": "+pairs.size());
			out.newLine();
		}
		
		out.flush();
		out.close();
		in.close();
	}
}
