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

}
package tp;
import java.io.*;
public class Numbers
{
    String input[];
    int n,m,g;
    int no;
    int ans[];
    int count=0;
    int j,t_c;
    int a,b;   
    DataInputStream dis=new DataInputStream(System.in);
    FileReader fr;
    BufferedReader br;

    Numbers() throws IOException
    {
        fr= new FileReader("D://D//input2.txt");
        br= new BufferedReader(fr);
    }
    void get() throws IOException // this is input ka process
    {
        String ip=br.readLine();// it will take entire line
        t_c= Integer.parseInt(ip);// taste case

        for(int i=1; i<=t_c; i++)
        {
            ip=br.readLine();
            String ip1[]= ip.split(" ");// split
            a= Integer.parseInt(ip1[0]);
            b= Integer.parseInt(ip1[1]);
            
            count=0;
            
            for(int y=a;y<b;y++)
                for(int z=y+1;z<=b;z++)
                {
                        rotate(y,z); 
               }
           System.out.println("Case #"+i+": "+ count);
        }
    }
    void rotate(int x,int y)
    {   
       int tem=x,c=0;
       while(tem!=0)
       {
           tem=tem/10;
           c++;
       }
       int a1=x;
       for(int i=0;i<c-1;i++)
       {
           
           tem=a1%10;
           a1=a1/10;
           a1+=tem*Math.pow(10,c-1);
           if(a1==y)
           {
                count++;
                return;
           }
       }
        
    }
    
    public static void main(String args[])throws IOException
    {
        Numbers n1=new Numbers();
        n1.get();

    }
    
}
    