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

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

/**
 *
 * @author kutub
 */
public class rn {
    public static void main(String args[]) throws FileNotFoundException
    {
        File f=new File("C:/Users/kutub/Documents/NetBeansProjects/JavaApplication1/src/javaapplication1/input3.txt");
        Scanner s=new Scanner(f);
        int n=0,a=0,b=0,count=0;
        while(s.hasNext())
        {
            n=s.nextInt();
            
            for(int i=1;i<=n;i++)
            {
                s.nextLine();
                a=s.nextInt();
                b=s.nextInt();
                count=0;
                
                for(int j=a;j<=b;j++)
                {
                    
                    if(j>=1000000 && j<=2000000)
                    {
                        
                        int k=j%10;
                        int l=j/10;
                        int m=l%10;
                        int no=l/10;
                        int ko=no%10;
                        int lo=no/10;
                        int ho=lo%10;
                        int go=lo/10;
                        int ao=go%10;
                        int bo=go/10;
                        int co=bo%10;
                        int ro=bo/10;
                                
                        int mo=k*1000000+l;
                        
                        if(mo>j && mo<=b && mo>a)
                        {
                            count++;
                        }
                        
                        mo=m*1000000+k*100000+no;
                        if(mo>j && mo<=b && mo>a)
                        {
                            
                            count++;
                        }
                        
                         mo=ko*1000000+m*100000+k*10000+lo;
                        if(mo>j && mo<=b && mo>a)
                        {
                            
                            count++;
                        }
                        
                        mo=ho*1000000+ko*100000+m*10000+k*1000+go;
                        if(mo>j && mo<=b && mo>a)
                        {
                            
                            count++;
                        }
                        mo=ao*1000000+ho*100000+ko*10000+m*1000+k*100+bo;
                        if(mo>j && mo<=b && mo>a)
                        {
                            
                            count++;
                        }
                        mo=co*1000000+ao*100000+ho*10000+ko*1000+m*100+k*10+ro;
                        if(mo>j && mo<=b && mo>a)
                        {
                            
                            count++;
                        }
                        
                    }
                    
                    if(j>=100000 && j<=1000000)
                    {
                        
                        int k=j%10;
                        int l=j/10;
                        int m=l%10;
                        int no=l/10;
                        int ko=no%10;
                        int lo=no/10;
                        int ho=lo%10;
                        int go=lo/10;
                        int ao=go%10;
                        int bo=go/10;
                                
                        int mo=k*100000+l;
                        
                        if(mo>j && mo<=b && mo>a)
                        {
                            
                            count++;
                        }
                        
                        mo=m*100000+k*10000+no;
                        if(mo>j && mo<=b && mo>a)
                        {
                            count++;
                        }
                        
                         mo=ko*100000+m*10000+k*1000+lo;
                        if(mo>j && mo<=b && mo>a)
                        {
                            count++;
                        }
                        
                        mo=ho*100000+ko*10000+m*1000+k*100+go;
                        if(mo>j && mo<=b && mo>a)
                        {
                            count++;
                        }
                        mo=ao*100000+ho*10000+ko*1000+m*100+k*10+bo;
                        if(mo>j && mo<=b && mo>a)
                        {
                            count++;
                        }
                       
                        
                    }
                    if(j>=10000 && j<=100000)
                    {
                        
                        int k=j%10;
                        int l=j/10;
                        int m=l%10;
                        int no=l/10;
                        int ko=no%10;
                        int lo=no/10;
                        int ho=lo%10;
                        int go=lo/10;
                                
                        int mo=k*10000+l;
                        
                        if(mo>j && mo<=b && mo>a)
                        {
                            count++;
                        }
                        
                        mo=m*10000+k*1000+no;
                        if(mo>j && mo<=b && mo>a)
                        {
                            count++;
                        }
                        
                         mo=ko*10000+m*1000+k*100+lo;
                        if(mo>j && mo<=b && mo>a)
                        {
                            count++;
                        }
                        
                        mo=ho*10000+ko*1000+m*100+k*10+go;
                        if(mo>j && mo<=b && mo>a)
                        {
                            count++;
                        }
                        
                       
                        
                    }
                    
                    if(j>1000 && j<=10000)
                    {
                        
                        int k=j%10;
                        int l=j/10;
                        int m=l%10;
                        int no=l/10;
                        int ko=no%10;
                        int lo=no/10;
                                
                                
                        int mo=k*1000+l;
                        
                        if(mo>j && mo<=b && mo>a)
                        {
                            count++;
                        }
                        
                        mo=m*1000+k*100+no;
                        if(mo>j && mo<=b && mo>a)
                        {
                            count++;
                        }
                        
                        mo=ko*1000+m*100+k*10+lo;
                        if(mo>j && mo<=b && mo>a)
                        {
                            count++;
                        }
                        
                       
                        
                    }
                    
                    if(j<=1000 && j>=100)
                    {
                        
                        int k=j%10;
                        int l=j/10;
                        int m=l%10;
                        int no=l/10;
                        
                        int mo=k*100+l;
                        
                        if(mo>j && mo<=b && mo>a)
                        {
                            
                            count++;
                        }
                        
                        mo=m*100+k*10+no;
                        if(mo>j && mo<=b && mo>a)
                        {
                            count++;
                        }
                    }
                    else if(j<=100 && j>=10 )
                    {
                        
                        int k=j%10;
                        int l=j/10;
                        int m=(k*10)+l;
                        
                        
                        if(m<=b && m>a && m>j)
                        {
                            
                            //System.out.println("j: "+j+"  mo: "+m);
                            count++;
                        }
                            
                    }
                }
                System.out.print("Case #"+i+": ");
                System.out.println(count);
            }
        }
    }
}
