/*
 * 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.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.util.HashMap;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;

public class Recycle {

	public static void main(String[] args) throws FileNotFoundException {
		Scanner sc = new Scanner(new File("C-small-attempt1.in"));
		int t; // number of test cases
		int n = 1;
		int counter=0;
		int A, B;

		HashMap<Integer,Integer> map = new HashMap<Integer,Integer>();
		t = sc.nextInt();
		//System.out.println("Output");

		for (int i = 0; i < t; i++) {
			A = sc.nextInt();
			B = sc.nextInt();
			String aStr = String.valueOf(A);
			
			int len = aStr.length();
			for (int c = A; c < B+1; c++) {
				for (int k=1; k<len; k++){
					//System.out.println("Before: "+c);
					char[] ch = String.valueOf(c).toCharArray();
					shiftRight(ch,k);
					//System.out.println("Shifted: "+String.valueOf(ch));
					int d = Integer.parseInt(String.valueOf(ch));
					
					if (c<d && d<B+1) {	
						if(map.containsKey(c)){
							if(map.get(c)!=d) {
								//System.out.println("--------------------------------Success!");
								counter++;	
								//System.out.println(counter+": Before: "+c+" After: "+d);
								map.put(c, d);
							}
						}
						else {
							//System.out.println("--------------------------------Success!");
							counter++;	
							//System.out.println(counter+": Before: "+c+" After: "+d);
							map.put(c, d);
						}
							
					}
				}

			}
			System.out.printf("Case #%d: %s\n", n++, counter);
			counter = 0;
			map = new HashMap<Integer,Integer>();
		}

	}

	public static char[] shiftLeft(char[] array, int amount) {
		for (int j = 0; j < amount; j++) {
			char a = array[0];
			int i;
			for (i = 0; i < array.length - 1; i++)
				array[i] = array[i + 1];
			array[i] = a;
		}
		return array;
	}

	public static char[] shiftRight(char[] array, int amount) {
		for (int j = 0; j < amount; j++) {
			char a = array[array.length - 1];
			int i;
			for (i = array.length - 1; i > 0; i--)
				array[i] = array[i - 1];
			array[i] = a;
		}
		return array;
	}
}
