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

}
/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recycled;

import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author Calido
 */
class myobj
{
	long n;
	long m;
	public myobj(long n,long m)
	{
		this.n=n;
		this.m=m;
	}
}

public class Recycled {

    /**
     * @param args the command line arguments
     */
    public static void main(String args[])
	{
		ArrayList list=new ArrayList();
		int t;
		long a,b,cnt;
		try
		{
			Scanner scnr=new Scanner(new File(args[0]));
			PrintWriter out=new PrintWriter(new File(args[1]));
			
			t=scnr.nextInt();
			for(int i=1;i<=t;i++)
			{
				//cnt=0;
				list.clear();
				a=scnr.nextLong();//inputing a
				b=scnr.nextLong();//inputing b
				for(long j=a;j<=b;j++)
				{
					long n=j;
					long m;
					long tmp1;
					int len=String.valueOf(n).length();
					for(int k=1;k<len;k++)
					{
						tmp1=n % (long)Math.pow(10,k);
						m=tmp1* (long)Math.pow(10,len-k);
                                                //System.out.print(tmp1+" ");
						tmp1=n / (long)Math.pow(10,k);
						//System.out.print(tmp1+" ");
                                                m=m+tmp1;
                                                
						if(n<m && m<=b)
						{
                                                    //System.out.print(n+":"+m+" ");
                                                    addtolist(list,new myobj(n,m));
							//cnt++;
						}
					}
				}
                                out.println("Case #"+i+": "+list.size());
                                System.out.println("Case #"+i+": "+list.size());
			}
                        
			out.close();
		}
		catch(FileNotFoundException fnfe)
		{
			System.out.println("File Not Found.");
		}
		
	}
	public static void addtolist(ArrayList list,myobj item)
	{
		boolean flag=false;
		for(int i=0;i<list.size();i++)
		{
			myobj tmp=(myobj)list.get(i);
			if(tmp.n==item.n && tmp.m==item.m)
			{
				flag=true;
			}
		}
		if(flag==false)
		{
			list.add(item);
		}
	}

}
