
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;
	}
	

}
//Kholofelo Moyaba
//Problem C codejam
//14 April 2012

import java.util.Scanner;

class RecycledNumbers
{
    public static void main(String[] args)
    {
        Scanner input = new Scanner(System.in);
        int cases = input.nextInt();
        for(int i=1;i<=cases;i++)
        {
            int a = input.nextInt();
            int b = input.nextInt();
            int digits = (a+"").length()-1;//number of digits -1
            int factor = 1;//factor in order of a and b
            for(int j=0;j<digits;j++,factor*=10);//factor=10^digit
            int result = 0;
            for(int n=a;n<b;n++){
                int[] buffer = new int[digits];//current pairs
                int m = n;//rotation of n into m
                for(int j=0;j<digits;j++){
                    m = m/10 + (m%10)*factor;//rotate
                    if(m<=b && n<m)//recycled pair
                    {//check if duplicate
                        boolean distinct = true;
                        for(int k=0;k<j;k++)
                            if(buffer[k]==m)
                            {
                                distinct = false;
                                break;
                            }
                        if(distinct)
                        {
                            result++;
                            buffer[j] = m;
                        }
                    }
                }
            }
            System.out.println("Case #"+i+": "+result);
        }
    }
}