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

public class gcj3 {
	static int T;
	static int AB[][];
	
	static void beolvas (String f) throws IOException {
		BufferedReader be = new BufferedReader(new FileReader(f));
		String sor = be.readLine();
		T = Integer.parseInt(sor);
		AB = new int[T][2];
		for (int i = 0; i < T; i++) {
			sor = be.readLine();
			AB[i][0] = Integer.parseInt(sor.split(" ")[0]);
			AB[i][1] = Integer.parseInt(sor.split(" ")[1]);
		}
	}
	
	static boolean recyclable (int n, int m) {
		if ( ((int) ((Math.log(n))/(Math.log(10)))) != ((int) ((Math.log(m))/(Math.log(10)))) ) return false;
		String ns = n+"";
		String ms = m+"";
		for (int i = 1; i <= ms.length(); i++) {
			char c = ms.charAt(ms.length()-1);
			ms = c + ms.substring(0,ms.length()-1);
			if (ns.equals(ms)) return true;
		}
		return false;
	}
	
	static void kiir () {
		System.out.println(T);
		for (int i = 0; i < T; i++) {
			System.out.println(AB[i][0]+" "+AB[i][1]);
		}
	}
	
	static int count (int a, int b) {
		int er = 0;
		for (int n = a; n < b; n++) {
			for (int m = n+1; m <= b; m++) {
				if (recyclable(n,m)) {
					// System.out.println(n+" es "+m+" ***IGEN***");
					er++;
				} else {
					// System.out.println(n+" es "+m+" nem");
				}
			}
		}
		
		return er;
	}
	
	public static void main (String args[]) throws IOException {
		beolvas("C-small-attempt0.in");
		// kiir();
		for (int k = 1; k <= T; k++) {
			System.out.println("Case #"+k+": "+count(AB[k-1][0],AB[k-1][1]));
		}
	}
}

