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

import java.io.File;
import java.io.FileWriter;
import java.util.ArrayList;
import java.util.Scanner;

/**
 *
 * @author daniele
 */
public class GCJ_C {
    
    public static void main(String[] args) throws Exception{
        
        
        
        Scanner in = new Scanner(new File(args[0]));
        FileWriter out = new FileWriter("/home/daniele/Scrivania/Output");
        

        int prove=in.nextInt();
        int min,max;
        int cifre;
        int cifreaus;
        String temp;
        int aus;
        int count=0;
        ArrayList<Integer> vals = new ArrayList<Integer>();
        int jcount=0;
        ArrayList<Integer> perm = new ArrayList<Integer>();
        
        out.write("");
        out.flush();
        
        for(int i=1;i<=prove;i++){
            
            out.append("Case #" +i+": ");out.flush();
            
            min=in.nextInt();
            max=in.nextInt();
            
            for(int j=min;j<=max;j++){
               if(!vals.contains(j)){
                    temp=""+j;
                    cifre=temp.length();
                    aus=j;
                    perm.add(j);
                    for(int k=1;k<cifre;k++){
                        aus=rotateOnce(aus);
                        temp=""+aus;
                        cifreaus=temp.length();//elusione zeri iniziali
                        if(aus>=min && aus<=max && aus!=j && cifreaus==cifre && nobody(vals,perm)){ 
                            perm.add(aus);
                            jcount ++;
                            
                        }
                        
                    }
                    while(jcount>0){count+=jcount; jcount--;}
                    vals.addAll(perm);
                    perm= new ArrayList<Integer>();
                    
                }
            }
            out.append(count+"\n");out.flush();
            count=0;
            vals= new ArrayList<Integer>();
        }
        
        
        
    }
        static public int rotateOnce(int n){
            String s=""+n;
            if(s.length()>1){
                s=s.charAt(s.length()-1) + s.substring(0,s.length()-1);
                n=Integer.parseInt(s);
            }
            return n;
        }    
        
        static public boolean nobody(ArrayList<Integer> v,ArrayList<Integer> a){;
            for(int i=0;i<a.size();i++)
                if(v.contains(a.get(i))) return false;
            return true;
        } 
    
}


import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.Scanner;

public class  Main
{
	private static int recycled(int n, int m)
	{
		String sN = (new Integer(n)).toString();
		String sM = (new Integer(m)).toString();
		int nL = sN.length();
		int mL = sM.length();
		
		HashMap<Integer, HashSet<Integer>> pairs = new HashMap<Integer, HashSet<Integer>>();
		
		for(int i = 0; i < nL; i++)
		{
			String swap = sN.substring(nL-1-i);
			String test = swap + sN.substring(0, nL-1-i);
			int testS = Integer.parseInt(test);
			if(testS == m)
			{
				if(!pairs.containsKey(testS))
				{
					HashSet<Integer> newSet = new HashSet<Integer>();
					newSet.add(m);
					pairs.put(testS, newSet);
				}
				else
				{
					pairs.get(testS).add(m);
				}
			}
		}
		
		Iterator<Integer> iter = pairs.keySet().iterator();
		int sum = 0;
		while(iter.hasNext())
		{
			sum += pairs.get(iter.next()).size();
		}
		
		return sum;
	}
	
	
	public static void main(String[] args)
	{
		Scanner inScan = new Scanner(System.in);
		
		int T = inScan.nextInt();
		//System.out.println(T);
		
		for(int t = 0; t < T; t++)
		{
			int A, B;
			
			A = inScan.nextInt();
			B = inScan.nextInt();
			//System.out.println(A);
			//System.out.println(B);
			int sum = 0;
			for(int n = A; n <= B; n++)
			{
				for(int m = B; m > n; m--)
				{
					sum += recycled(n, m);
					//System.out.println("LOOP");
				}
			}
			
			System.out.println("Case #" + (t+1) + ": " + sum);
		}
	}
}