
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.*;
public class Prob3
{
    public static void main (String[] args) throws IOException
    {
	BufferedReader in = new BufferedReader (new FileReader ("C-small-attempt0.in"));
	PrintWriter out = new PrintWriter (new FileWriter ("OUT3.txt"));
	int T = Integer.parseInt (in.readLine ().trim ()), c, a, b;
	StringTokenizer st;
	String temp, hold;
	ArrayList p;
	for (int x = 0 ; x < T ; x += 1)
	{
	    c = 0;
	    st = new StringTokenizer (in.readLine ());
	    a = Integer.parseInt (st.nextToken ());
	    b = Integer.parseInt (st.nextToken ());

	    for (int y = a ; y < b ; y += 1)
	    {
		if (y > 10)
		{
		    temp = Integer.toString (y);
		    p = new ArrayList ();
		    for (int z = 0 ; z < temp.length () - 1 ; z += 1)
		    {
			hold = temp.substring (z + 1) + temp.substring (0, z + 1);
			if (hold.charAt (0) != '0' && Integer.parseInt (hold) > Integer.parseInt (temp) && Integer.parseInt (hold) <= b && p.contains (hold) == false)
			{
			    c += 1;
			    p.add (hold);
			}
		    }
		}
	    }
	    out.println ("Case #" + (x + 1) + ": " + c);
	}
	out.close ();
    }
}


