
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.*;

public class recycled {
	private boolean compare(String s1, String s2){
		String s3 = s2+s2;
		boolean result = s3.contains(s1);
		return result;
	}
	private void go() throws Exception {
		File infile = new File("C-small-attempt1.in");
		BufferedReader br = new BufferedReader(new InputStreamReader(
				new FileInputStream(infile)));
		int num_of_cases = Integer.parseInt(br.readLine());
		for (int i = 1; i <= num_of_cases; i++) {
			String[] case_str = br.readLine().split(" ");
			int begin_num = Integer.parseInt(case_str[0]);
			int end_num = Integer.parseInt(case_str[1]);
			int satisifed = 0;
			for(int k=begin_num;k<end_num;k++){
				if(k/10==0)continue;
				String cur_num_str = new Integer(k).toString();
				for(int j=k+1;j<=end_num;j++){
					if(compare(cur_num_str,new Integer(j).toString()))
							satisifed++;
				}
			}
			System.out.println("Case #"+i+": "+satisifed);
		}
	}
	public static void main(String[] args){
		try {
			new recycled().go();
		} catch (Exception ex) {
			ex.printStackTrace();
		}
	}
}
