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

public class Recycled {
	public void calc() {
		Scanner in = null;
		PrintStream out = null;
		try {
			// in = new Scanner(new File("./A-small-attempt3.in"));
			in = new Scanner(System.in);
			out = new PrintStream(new File("./out.txt"));
		} catch (Exception e) {
			System.err.println(e);
			System.exit(-1);
		}

		int lines = in.nextInt();
		in.nextLine();
		for (int i = 0; i < lines; i++) {
			out.print("Case #");
			out.print(i + 1);
			out.print(": ");
			int b = in.nextInt();
			int e = in.nextInt();
			in.nextLine();
			int count = 0;
			Set<String> set = new HashSet<String>();
			for (int j = b; j < e; j++) {
				set.clear();
				String s = Integer.toString(j);
				for (int c = 1; c < s.length(); c++) {
					String d = s.substring(c).concat(s.substring(0, c));
					int di = Integer.parseInt(d, 10);
					if (di > j && di <= e) {
						if (!set.contains(d)) {
							set.add(d);
							count++;
						}
					}
				}
			}
			out.print(count);
			out.print('\n');
		}
		out.flush();
		out.close();
		in.close();
	}

	public static void main(String[] args) {
		Recycled g = new Recycled();
		g.calc();
	}

}
