import java.io.*;
import java.math.BigInteger;
import java.util.*;

import org.jfree.data.function.PowerFunction2D;

public class r2a
{

	Map numMap = new HashMap();
    int output = 0;

    /**
     * @param args
     */
    public static void main(String[] args)
    {
        r2a mk = new r2a();
        try {
            FileInputStream fstream = new FileInputStream("d:/cjinput.txt");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            String str;
            int i = 0;
            while ((str = br.readLine()) != null) {
            	int begin=0,end = 0;
                i++;
                if (i == 1)
                    continue;
                mk.numMap = new HashMap();
                StringTokenizer strTok = new StringTokenizer(str, " ");
                while (strTok.hasMoreTokens()) {
                	begin =  Integer.parseInt(((String) strTok.nextToken()));
                    end = Integer.parseInt(((String) strTok.nextToken()));
                }

                mk.evaluate(i, begin, end);

            }
            in.close();
        }
        catch (Exception e) {
            System.err.println(e);
        }

    }

    private void evaluate(int rowNum, int begin, int end)
    {
    	output=0;
    	for (int i = begin; i<= end; i++) {
    		if(numMap.containsKey(Integer.valueOf(i)))
    			continue;
    		List l = getPairElems(i);
    		if (l.size() > 0) {
    			Iterator itr = l.iterator();
    			int ctr = 0;
    			ArrayList tempList = new ArrayList();
    			while (itr.hasNext()) {
    				int next = ((Integer)itr.next()).intValue();
    				if (next <= end && next > i) {
    					numMap.put(Integer.valueOf(next), i);
    					tempList.add(next);
    					ctr++;
    				}
    			}
    			ctr = getCounter(ctr+1,2);
/*    			if (tempList.size() > 0 || ctr > 0)
    				System.out.println("DD: " + i + ": " + tempList +" ; ctr = " + ctr);*/
    			output = output + ctr;
    		}
    		
    	}

        String outputStr = "Case #" + (rowNum -1) + ": " + output;
        
        System.out.println(outputStr);
    }

	private int getCounter(int n, int r) {
		int ret = 1;
		int nfactorial =1;
		for (int i = 2; i<=n; i++) {
			nfactorial = i*nfactorial;
		}
		int nrfact =1;
		for (int i = 2; i<=n-r; i++) {
			nrfact = i*nrfact;
		}
		
		return nfactorial/(2*nrfact);
	}

	private ArrayList getPairElems(int num) {
		ArrayList retList = new ArrayList();
		int temp = num;
		if (num/10 == 0)
			return retList;
		
		String str = String.valueOf(num);
		
		int arr[] = new int[str.length()];
		int x = str.length();
		while (temp/10 > 0) {
			arr[x-1] = temp%10;
			temp=temp/10;
			x--;
		}
		arr[0]=temp;
		
		int size = arr.length;
		for (int pos = size -1; pos >0; pos--) {
			if(arr[pos] == 0)
				continue;
			int pairNum = 0;
			int multiplier =1;
			for (int c=0; c < size-1; c++) {
				multiplier = multiplier*10;
			}
			pairNum = pairNum + (arr[pos]*multiplier);
			for(int ctr = pos+1, i=1; i < size; i++,ctr++) {
				if (ctr == size)
					ctr=0;
				if (multiplier!=1)
					multiplier=multiplier/10;
				pairNum = pairNum + (arr[ctr]*multiplier);
			}
			if (pairNum != num)
				retList.add(Integer.valueOf(pairNum));			
		}
		
		return retList;
	}
}

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

import java.util.LinkedList;
import java.util.Scanner;

/**
 *
 * @author Venkatesh
 */
public class reversal {

    
    public static void main(String args[])
    {
        Scanner s=new Scanner(System.in);
        int t=s.nextInt();
       
        int currelement;
        int a,b,ind=1,temp,digits=0,temp1,temp2,count=0;
        boolean samedigits=true;
        boolean next=false;
        LinkedList list=new LinkedList();
        
       
        while(ind<=t)
        {
            samedigits=true;
            next=false;
            digits=0;
          
            a=s.nextInt();
           
            b=s.nextInt();
          
            if(b<10)
            {
                System.out.println("Case #"+ind+": 0");
                ind++;
                continue;
            }
            
            temp=a;
            
            while(temp!=0)
            {
                temp/=10;
                 digits++;
            }
          
            
            int arr[]=new int[digits];
            int barr[]=new int[digits];
            //int mainarray[]=new int[digits];
            
            temp2=b;
            for(int i=digits-1;i>=0;i--)
            {      
                barr[i]=temp2%10;
                temp2/=10;
             
            }
             
            temp=a;
            
            while(temp<=b)
            {
             //   if(temp==1113)
             //      System.exit(0);
               
            //  System.out.println("Examining "+temp);
                 temp1=temp;
                 samedigits=true;
              
            for(int i=digits-1;i>=0;i--)
            {      
                arr[i]=temp1%10;
                temp1/=10;
              // System.out.println(arr[i]);
                
                if(i<digits-1)
                    if(arr[i+1]!=arr[i])
                        samedigits=false;
            }

            if(samedigits)
            {
         //      System.out.println("Same digits");
                temp++;
                continue;
            }
            
          
            //not same start checking
           for(int j=1;j<digits;j++)
           {
        //       System.out.println("checking "+arr[j]);
               if(arr[j]==0)
               {
            //        System.out.println("skipping zero");
                   continue;
               }
               
               if(arr[j]<barr[0])
               {
                   
                   //check for digits of a 
                   if(arr[j] > arr[0])
                   {
                  // System.out.println("Success ");
                   
                       //if already present dont add
                       currelement=arraytoint(arr,j);
                       if(list.contains(currelement)==false)
                       {
                           count++;
                           list.add(currelement);
                       }
                   
                   continue;
                   }
                   else if(j!=0 && arr[j] == arr[0])
                   {
                     //     System.out.println("equal");
                       int g=j;
                       int h=0;
                       while(arr[(++g)%digits] == arr[(++h)%digits])
                       {
                          
                           if((h%digits)==0)
                               break;
                       }
                       
                       if(arr[g%digits]>arr[h%digits])
                       {
                              //System.out.println("Success ");//+arr[g%digits]);
                     //if already present dont add
                       currelement=arraytoint(arr,j);
                       if(list.contains(currelement)==false)
                       {
                           count++;
                           list.add(currelement);
                       }
                               continue;
                       }
                   }
               }
               else
                   if(arr[j]==barr[0])
                   { 
                       
                       int k=0;
                       int newind=j;
                     
                       ++newind;
                       ++k;
                       while(arr[(newind)%digits] ==  barr[(k)%digits])
                       {  
                       //    System.out.println("arr[(newind)%digits] "+newind%digits+" barr[(k)%digits] "+(k)%digits);
                           if((k)%digits==0)
                           {
                                newind=j;
                            //check for digits of a 
                             if(arr[newind%digits] > arr[0])
                             {
                              //System.out.println("Success ");//+arr[newind%digits]);
                             //if already present dont add
                       currelement=arraytoint(arr,j);
                       if(list.contains(currelement)==false)
                       {
                           count++;
                           list.add(currelement);
                       }
                              next=true;
                              break;
                             }
                             else if(newind%digits!=0 && arr[newind%digits] == arr[0])
                             {
                                 int g=newind%digits;
                                 int h=0;
                                while(arr[(++g)%digits] == arr[(++h)%digits])
                                 {
                                  if((h%digits)==0)
                                  break;
                                 }
                               if(arr[g%digits]>arr[h%digits])
                               {
                                  //System.out.println("Success ");//+arr[g%digits]);
                             
                                   //if already present dont add
                       currelement=arraytoint(arr,j);
                       if(list.contains(currelement)==false)
                       {
                           count++;
                           list.add(currelement);
                       }
                                      next=true;
                                    break;
                                }
                             }
                          //end of proc
                           }
                           newind++;
                           ++k;
                       }
                       
                        if(next)
                        {
                            next=false;
                            continue;
                        }
                       if(arr[newind%digits]< barr[k%digits])
                       {  
                    //         System.out.println("arr[newind%digits]< barr[k%digits] "+newind%digits+" "+ k%digits);
                              newind=j;
                             //check for digits of a 
                             if(arr[newind%digits] > arr[0])
                             {
                             //System.out.println("Success ");//+arr[newind%digits]);
                            //if already present dont add
                       currelement=arraytoint(arr,j);
                       if(list.contains(currelement)==false)
                       {
                           count++;
                           list.add(currelement);
                       }
                             }
                             else if(newind%digits!=0 && arr[newind%digits] == arr[0])
                             {
                                 int g=newind%digits;
                                 int h=0;
                                while(arr[(++g)%digits] == arr[(++h)%digits])
                                 {
                                  if((h%digits)==0)
                                  break;
                                 }
                               if(arr[g%digits]>arr[h%digits])
                               {
                                  //System.out.println("Success ");//+arr[g%digits]);
                                  //if already present dont add
                       currelement=arraytoint(arr,j);
                       if(list.contains(currelement)==false)
                       {
                           count++;
                           list.add(currelement);
                       }
                                }
                             }
                          //end of proc
                       }
                   }
                 }
           
                 temp++;
                 list.removeAll(list);
               }
            System.out.println("Case #"+ind+": "+count);
            ind++;
            count=0;
    }
        
  
}
    
        static int arraytoint(int[] b,int index)
        {
            int i=0,temp;
            int len=b.length;
            int a[]=new int [len];
            
            temp=a[index];
            for(int j=0;j<len;j++)
            {
                a[j]=b[(j+index)%len];
                
            }
           
            
           for(int ind=0;ind<len;ind++)
           {
               i+=a[ind]*Math.pow(10,len-ind-1);
           }
         
            return i;
        }
}