/*
 * 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;
        } 
    
}


/**
 * KSpokas: GCJ 2012 Qualification Round Problem C - Recycled Numbers
 */

import java.io.BufferedReader;
import java.io.BufferedWriter;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;


public class qualProblemC {
	private final static int EXPECTED_ARG_COUNT = 1;
	
	public static void main(String[] args) {
		if (args.length != EXPECTED_ARG_COUNT) {
			System.err.println("Error: expecting " + EXPECTED_ARG_COUNT);
			return;
		}
		
		String fileName = args[0];
		try {
		    FileInputStream fstream = new FileInputStream(fileName);
		    DataInputStream in = new DataInputStream(fstream);
		    BufferedReader br = new BufferedReader(new InputStreamReader(in));
		    BufferedWriter out = new BufferedWriter(new FileWriter(fileName + ".out"));
		    
		    Integer testCaseCount = Integer.parseInt(br.readLine());
		    
		    for (int i = 0; i < testCaseCount; i++) {
		    	String strLine = br.readLine();
		    	
		    	StringBuilder sb = new StringBuilder("Case #");
		    	sb.append(i + 1).append(": ");
		    	sb.append(calculate(strLine));
		    	out.write(sb.toString());
		    	out.newLine();
		    }
		    in.close();
		    out.close();
	    } catch (Exception e) {
	    	System.err.println("Error: " + e.getMessage());
	    }
	}
	
	private static int calculate(String input) {
		String[] values = input.split(" ");
		Integer min = Integer.parseInt(values[0]);
		Integer max = Integer.parseInt(values[1]);
		
		Set<String> duplicates = new HashSet<String>();
		for (int i = min; i <= max; i++) {
			String num = String.valueOf(i);
			for (int j = 1; j < num.length(); j++) {
				Integer offset = Integer.parseInt(num.substring(j) + num.substring(0, j));
				if (offset != i && offset <= max && offset >= min) {
					duplicates.add(
							(i < offset) 
									? num.toString() + ":" + offset.toString() 
									: offset.toString() + ":" + num.toString());
				}
			}
		}
		
		return duplicates.size();
	}
	
}
