/*
 * 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.util.Scanner;
import java.io.File;

public class RecycledNumbers {
	public static void main(String[] args) {
		Scanner input = null;
		boolean[][] counted;

	    try {
	        input = new Scanner(new File(args[0]));
	    } catch (Exception e) {
	        System.out.println("Please pass a correct filename as a program parameter");
	    	System.exit(1);
    	}

    	int t, a, b;

    	t = input.nextInt();
    	input.nextLine();

    	int recycledCount = 0;

    	for (int testNumber = 0; testNumber < t; testNumber++) {
	    	a = input.nextInt();
    		b = input.nextInt();
    		input.nextLine();

    		counted = getFalseArray(b-a+1);

    		// For each test case, look at all numbers between A and B as a possibleN
    		for (int possibleN = a; possibleN <= b; possibleN++) {
    			// For each possibleN, consider each recycled form
    			for (int offset = 1; offset < String.valueOf(possibleN).length(); offset++) {
    				int cycledN = Integer.parseInt(cycleRight("" + possibleN, offset));
    				// For each recycled form, consider whether it is within the appropriate range
    				if (cycledN >= a && cycledN <= b) {
    					// These numbers are cycled forms of eachother. Are they suitable?
    					if (possibleN != cycledN && counted[min(possibleN, cycledN)-a][max(possibleN, cycledN)-a] == false) {
    						counted[min(possibleN, cycledN)-a][max(possibleN, cycledN)-a] = true;
    						recycledCount++;
						}
    				}
				}
    		}

    		System.out.println("Case #" + (testNumber+1) + ": " + recycledCount);
    		recycledCount = 0;
    	}
	}

	public static String cycleRight(String number, int positions) {
		int intLen = number.length();

		while (positions > 0) {
			// Cycle one right
			number = number.charAt(intLen-1)+number.substring(0, intLen-1);
			positions--;
		}

		return number;
	}

	public static boolean[][] getFalseArray(int size) {
		boolean[][] array = new boolean[size][size];

		for (int i = 0; i < size; i++) {
			for (int j = 0; j < size; j++) {
				array[i][j] = false;
			}
		}

		return array;
	}

	public static int min(int a, int b) {
		return (a < b ? a : b);
	}

	public static int max(int a, int b) {
		return (a < b ? b : a);
	}
}