
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.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;


public class Recycle {

	/**
	 * @param args
	 */
	
	static int t =0;
	
	//static ArrayList<ArrayList<String>> table = new ArrayList<ArrayList<String>>();	

		public static void inputF() throws FileNotFoundException{
			
			File inputFile = new File("C-small-attempt1.in");
			Scanner in = new Scanner(inputFile);
			File outputFile = new File("C-small-attemp1.out");
			PrintWriter out = new PrintWriter(outputFile);
			String result="";
			String input ="";
	  
			int n,m=0;
			
			t = in.nextInt();
			//System.out.println(n);
			input = in.nextLine();
			for (int i=1; i<=t; i++) {
				 n =in.nextInt();
				 m =in.nextInt();
				//System.out.println("length of the list: "+list.length);
				result = "Case #"+i+ ": "+ count(n,m);
				out.println(result);
			}
			in.close();
			out.close();
		}
	
	private static int count(int n, int m) {
		int result =0;	
		boolean isRecycle = false;
		ArrayList list = new ArrayList<Integer>();
		
		for (int i=n; i<=m;i++){
			String ori=Integer.toString(i);
			isRecycle = false;
			list = new ArrayList<Integer>();
			for(int j=1; j<ori.length();j++){
				String cut = ori.substring(j, ori.length());
				String res = (cut+ori).substring(0, ori.length());
				//System.out.println(res);
				int resInt = Integer.parseInt(res);
				if ((resInt>i)&(resInt<=m)) {
					if ((!isRecycle)|((isRecycle)& (!list.contains(resInt)))){
					result++;
					isRecycle=true;
					list.add(resInt);
					//System.out.println(i+"-->"+resInt);
					//out.println(resInt);
				}
				}
			}
		}
		return result;
		}

	public static void main(String[] args) throws FileNotFoundException {
		inputF();

	}

}
