/*
 * 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.FileReader;
import java.io.FileWriter;
import java.io.PrintWriter;
import java.util.BitSet;


public class ProbC {
	
	public static long solve(int A, int B) {
		int[] basePower = new int[8];
		basePower[0] =1;
		for(int i=1; i<8; i++)
			basePower[i] = basePower[i-1] * 10;
		
		long count = 0;
		BitSet mask = new BitSet(B+1);
		int[] digits = new int[8];
		
		for(int i=A; i<=B; i++) {
			if(mask.get(i)) continue;
			mask.set(i);
			int candidate = i;
			int nCandidates = 1;
			int size = 0;
			while(candidate > 0) {
				digits[size] = candidate % 10;
				candidate /= 10;
				size++;
			}
			if(size > 1) {
			   for(int j=0; j<size-1; j++) {
				   int part1 = 0;
				   int part2 = 0;
				   for(int k=j; k>=0; k--) {
					   part1 = part1 * 10 + digits[k];
				   }
				   for(int k=size-1; k>j; k--) {
					   part2 = part2 * 10 + digits[k];
				   }
				   
				   if(part1 != 0) {
					   int value = part1 * basePower[size-1-j] + part2;
					   if(value >= A && value <=B && !mask.get(value)) {
						   nCandidates++;
						   mask.set(value);
					   }
				   }
			   }
			   count += (nCandidates-1) * nCandidates/2;
			}
		}
		return count;
	}
	
	public static void main(String[] args) throws Exception {
		BufferedReader in = new BufferedReader(new FileReader("C-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new FileWriter("C.out"));
		String line = in.readLine();
		int T = Integer.parseInt(line);
		for(int i=1; i<=T; i++) {
			line = in.readLine();
			String[] comp = line.split("\\s+");
			int A = Integer.parseInt(comp[0]);
			int B = Integer.parseInt(comp[1]);
			
			out.print("Case #" + i+ ": ");
			out.println(solve(A, B));
		}
		
		out.flush();
		in.close();
		out.close();
	}
}
