
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 static java.lang.System.*;
import static java.lang.Math.*;
import static java.lang.Character.*;
import java.io.*;
import java.util.*;
public class recycled
{
    public static Scanner in;
    public static String nl(){return in.nextLine();}
    public static int ni(){return in.nextInt();}
    public static double nd(){return in.nextDouble();}
    public static int pi(String a){return Integer.parseInt(a);}
    public static double pd(String a){return Double.parseDouble(a);}
    public static void pl(Object o) { out.println(o); }
    public static void pl() { out.println(); }
    public static void pt(Object o) { out.print(o); }
    public static void plf(String f, Object... o) { out.printf(f, o); out.println(); }
    public static String nt(){return in.next();}
    public static void main(String[]args) throws IOException
    {
    	in=new Scanner(new File("recycled.dat"));
        in=new Scanner(new File("C-small-attempt2.in"));
    //    in=new Scanner(System.in);
	    int count  = ni();
	    for (int da = 1; da <= count; da++)
	    {
	    	int s = ni(), e = ni();
	    	//pl (s + ", " + e);
	        TreeSet<String> gused = new TreeSet<String>();
	        for (int xx = s; xx < e; xx++)
	        {
	        	String n = "" + xx;


        		ArrayList<Character> alt = new ArrayList<Character>();
        		for (char c : n.toCharArray())
        			alt.add(c);
	        	for (int i = 0; i < n.length(); i++)
	        	{
	        		Collections.rotate(alt, 1);

	        		String t = "";
	        		for (Character c : alt)
	        			t += "" + c;
	        		//pl(t);
	        		//pl(n);
	        		if (!gused.contains(t+"|"+n) && pi(n) >= s && pi(t) <= e && pi(n) < pi(t))
	        		{
	        			gused.add(t+"|"+n);

	        		}
	        	}

	        }
	        pl("Case #" + da + ": " + gused.size());
	    }
    }
}