
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.util.*;
public class b {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		Scanner sc = new Scanner(System.in);
		String ss = sc.nextLine();
		int casenum = Integer.parseInt(ss);
		String answer = "";
		for(int i = 1;i<=casenum;i++){
			answer = answer.concat("Case #".concat(Integer.toString(i)).concat(": "));
			ss = sc.nextLine();
			String wer = recycledpair(ss);
			answer = answer.concat(wer);
			answer = answer.concat("\n");
		}
		System.out.print(answer);
	}
	
	public static String recycledpair(String a){
		int n = Integer.parseInt(a.substring(0, a.indexOf(' ')));
		int m = Integer.parseInt(a.substring(a.indexOf(' ')+1, a.length()));
		int nlength = a.substring(0, a.indexOf(' ')).length();
		int pairnum = 0;
		String rcp ="";
		for(int i=n; i<m; i++){
			LinkedList<Integer> mylist = new LinkedList<Integer>();
			String sn = Integer.toString(i);
				//a.substring(0, a.indexOf(' '));
			for(int j=1; j<sn.length(); j++){
				String newnum = sn.substring(j,sn.length()).concat(sn.substring(0,j));
				int newint = Integer.parseInt(newnum);
				if(newint>i&&newint<=m){
					if(!mylist.contains(newint)){
					pairnum++;
					mylist.add(newint);
					}
					else{
						mylist.add(newint);
					}
				}
			}
		}
		String snumreturn = Integer.toString(pairnum);
		//System.out.print(snumreturn);
		return snumreturn;
	}
}
