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

public class ProblemB {

	BufferedReader input;
	BufferedWriter output;

	public static void main(String[] args) {
		(new ProblemB()).solve();
	}

	private void solve() {
		try {
			input = new BufferedReader(new FileReader("E://Technical/eclipse/workspace/CodeJam2012/input/C-small-attempt0.in"));
			output = new BufferedWriter(new FileWriter("E://Technical/eclipse/workspace/CodeJam2012/output/problemB.out"));

			int T = Integer.parseInt(input.readLine());

			for(int i=0; i < T; i++) {

				String[] t = input.readLine().split(" ");

				long A = Long.parseLong(t[0]);
				long B = Long.parseLong(t[1]);

				long y = 0;
				HashSet o = new HashSet();

				for(long j = A; j <= B; j++) {
					if(j>9) calculate(j, A, B,o);
				}

				y = o.size() / 2;
				output.write("Case #" + (i + 1) + ": " + y + "\n");
			}

			output.flush();
			System.out.println("completed");
		} catch (Exception ex) {
			ex.printStackTrace();
		}		
	}

	public void calculate(long number, long A, long B, HashSet o)
	{
		long y = 0;
		long t = number;

		int n = (int) Math.log10((double)number);
		int m = (int) Math.pow(10.0, (double)n);
		
		while(true)
		{
			long r = number % 10;

			number = number / 10;
			number = number + m * r;

			if(number != t && number >= A && number <= B) {
				o.add(t+":"+number);
				o.add(number+":"+t);
			}

			if(number == t)
				break;
		}
	}	
}
