/*
 * 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.IOException;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.regex.Matcher;
import java.util.regex.Pattern;

/**
 * Google code jam.
 * Qualification Round 2012.
 * Problem C. Recycled Numbers
 * 
 * Usage: &lt;app&gt; &lt;input &gt;output
 * 
 * @author sombrabr@gmail.com
 *
 */
public class QualC {

	public static void main(String[] args) throws NumberFormatException, IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		
		int cases = new Integer(in.readLine());
		
		for(int i=0; i<cases; ++i) {
			String line = in.readLine();
			System.out.print("Case #" + (i+1) + ": ");
			run(line);
		}
	}

	private static void run(String line) {
		String[] parts = line.split(" ");
		
		int digits = parts[0].length();
		
		int A = Integer.parseInt(parts[0]);
		int B = Integer.parseInt(parts[1]);
		
		int count = 0;
		
		for(int n=A; n<=B; ++n) { // n is the number to recycle
			String strN = Integer.toString(n);
			
			if(strN.length()!=digits)
				continue;
			
			HashSet<Integer> numbers = new HashSet<Integer>();
			
			for(int i=1; i<digits; ++i) {
				Pattern p = Pattern.compile("(\\d*)(\\d{" + i + "})");
				Matcher m = p.matcher(strN);
				
				if(!m.matches()) {
					System.err.println("BUG: " + strN + " for " + i + " digits");
					return;
				}
				
				String strNewN = m.group(2) + m.group(1);
				if(strNewN.length() != digits) {
					System.err.println("BUG: " + strN + " for " + i + " digits with " + strNewN);
					return;
				}
				
				int newN = Integer.parseInt(strNewN);
				
				if(n < newN && newN <= B && ! numbers.contains(newN)) {
					count++;
					numbers.add(newN);
				}
			}
		}
		
		System.out.println(count);
	}
}
