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

public class ProblemC {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		BufferedReader br = null;
		BufferedWriter bw = null;
		String input = null;
		StringBuffer output = null;
		String[] twonumbers = null;
		int min = 0, max = 0;
		ArrayList<String> list = null;
		ArrayList<String> list1 = null;
		String temp = null;
		String strmin = "";
		int tempint = 0;
		int counter = 0;
		int digit1 = 0, digit2 = 0;
		try {
			br = new BufferedReader(new FileReader(new File(
					"C:/Users/DHAVAL/Downloads/InputX.txt")));
			bw = new BufferedWriter(new FileWriter("output4.txt"));
			int count = Integer.parseInt(br.readLine());
			for (int i = 0; i < count; i++) {
				input = br.readLine();
				output = new StringBuffer("Case #" + (i + 1) + ": ");
				counter=0;
				// logic here
				list = new ArrayList<String>();
				list1 = new ArrayList<String>();
				twonumbers = input.split(" ");
				min = Integer.parseInt(twonumbers[0]);
				max = Integer.parseInt(twonumbers[1]);
				if (max >= 10) {
					for (int j = min; j <= max; j++) {
						strmin = "" + j;
						temp = strmin;
						for (int k = 0; k < strmin.length() - 1; k++) {
							temp = temp.substring(1) + temp.charAt(0);
							tempint = Integer.parseInt(temp);
							digit1 = ("" + tempint).length();
							digit2 = strmin.length();
							if (j < tempint && digit1 == digit2
									&& tempint >= min && tempint <= max
									&& !list.contains(strmin + "||" + temp)
									//&& !list1.contains(temp)
									&& !temp.equals(strmin)) {
								//System.out.println(strmin + " " + tempint);
								//list1.add(temp);
								list.add(strmin + "||" + temp);
								counter++;
							}
						}
					}
				}
				bw.write(output.toString() + counter);
				bw.newLine();
			}
			bw.close();
		} catch (Exception e) {
			e.printStackTrace();
		}

	}

}
