/*
 * 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.LinkedList;
import java.util.List;


public class Secundaria 
{
	public Secundaria()
	{
		
	}
	
	public int nVeces(int primero, int ultimo)
	{
		int i = 0;
		
		if(primero <= 9 && ultimo <=9)
			return 0;
		
		LinkedList<Integer> lista;
		for(int j = primero; j <= ultimo; j++)
		{
			lista = deparse(j);
			for(int k = j+1; k <= ultimo; k++)
			{
				for(int r = 0; r < lista.size(); r++)
				{
					int prueba = monta(lista);
					if(k == prueba)
						i++;
					int x = lista.pop();
					lista.addLast(x);
				}
			}
		}
				
		return i;
	}
	
	public int monta(LinkedList<Integer> l)
	{
		int res = 0;
		int a = 1;
		for(int i = 0; i < l.size(); i++)
		{
			for(int k = i;k < l.size(); k++)
				a *= 10;
			
			res += l.get(i) * a;
			a = 1;
		}
		res = res / 10;
		return res;
	}
	
	public LinkedList<Integer> deparse(int k)
	{
		LinkedList<Integer> ret = new LinkedList<Integer>();
		
		int r = k;
		while(r != 0)
		{
			ret.addFirst(r % 10);			
			r = r / 10;
		}
				
		return ret;
	}
}
