
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.*;
import static java.lang.Integer.*;


public class RecycledNumbers {
	

	public static void main(String[] args) throws IOException {
		BufferedReader scan = new BufferedReader(new InputStreamReader(
				System.in));
		int n = parseInt(scan.readLine());
		for (int i = 0; i < n; i++) {
			String[] line = scan.readLine().split(" ");
			int inf = parseInt(line[0]);
			int sup = parseInt(line[1]);
			int res = 0;
			for(int j = inf;j<=sup;j++){
				for (int j2 = j+1; j2 <= sup; j2++) {
					res+=check(j,j2);
				}
			}
			System.out.println("Case #"+(i+1)+": "+res);
		}
	}
	
	public static int check(int a,int b){
		int res = 0;
		int tama = count(a);
		int tamb = count(b);
		String sa = (a+"");
		String sb = (b+"");
		if(tama==tamb){
			for (int i = 0; i <tama; i++) {
				if(sa.charAt(i)==sb.charAt(0)){
					String aux = sa.substring(i,sb.length())+sa.substring(0,i);
					if(sb.equals(aux)){
						return 1;}
				}
			}
		}
		return res;
	}
	
	public static int count(int a){
		int res = 0;
		while(a!=0){
			a=a/10;
			res++;
		}
		return res;
	}
}
