/*
 * 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.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileReader;
import java.io.FileWriter;
import java.util.HashSet;
import java.util.Set;


public class QRC 
{
	// Basics for all problems
	private static final String LARGE = "large";
	private static final String SMALL = "small";
	private static final String IN = ".in";
	private static final String OUT = ".out";
	private static String SET;
	
	// Problem specific Globals
	private static Set<Pair> mPairs;
	
	public static void main(String[] args) throws Exception
	{
		SET = SMALL; // Which set id being evaluated
		readInputFile(SET+IN);
	}
	
	private static void readInputFile(String in) throws Exception
	{
		BufferedReader br = new BufferedReader(new FileReader(new File(SET+IN)));
		String line = null;
		int caseCount = 1;
		
		br.readLine();
		while ( (line = br.readLine()) != null )
		{
			String[] input = line.split(" ");
			final int A = Integer.parseInt(input[0]);
			final int B = Integer.parseInt(input[1]);
			mPairs = new HashSet<Pair>();
			for (int n = A; n < B; n++ )
			{
				String rotation = String.valueOf(n);
				int digitCount = rotation.length();
				for ( int i = 0; i < digitCount; i++ )
				{
					rotation = rotateN(rotation);
					int m = Integer.parseInt(rotation);
					if ( m > n && m <= B )
					{	
						mPairs.add(new Pair(n,m));
						//System.out.println(" --> ("+n+", "+m+") @ "+mPairs.size());
					}
				}
			}
			writeOutputLine(String.format("Case #%d: %d", caseCount, mPairs.size()));
			caseCount++;
		}
		
		br.close();
	}
	
	private static String rotateN(String nAsString)
	{	
		String bulk = nAsString.substring(0,nAsString.length()-1);
		char jumper = nAsString.charAt(nAsString.length()-1); 
		return jumper+bulk;
	}
	
	private static void writeOutputLine(String line) throws Exception
	{
		BufferedWriter bw = new BufferedWriter(new FileWriter(new File(SET+OUT),true));
		bw.append(line);
		bw.newLine();
		bw.flush();
		bw.close();
	}
}
