/*
 * 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.*;
import java.util.*;
import java.math.*;
import java.text.*;

public class C {
	public static void pl(Object O) {System.out.println(O);}
	public static void pl() {System.out.println();}
	public static void pr(Object O) {System.out.print(O);}
	public static void p(Object O) {System.out.print(O);}
	public static void pf(String f, Object...args) {System.out.printf(f,args);}
	
	public static Scanner sc;
	public static String n() {return sc.next();}
	public static String nl() {return sc.nextLine();}
	public static int ni() {return sc.nextInt();}
	public static double nd() {return sc.nextDouble();}
	
	public static void main(String[] args) throws Exception {
		String file = args.length>0?args[0]:"c-sample.in";
		sc = new Scanner(new File(file));
		
		int kk = ni(); nl();
		for (int qq = 0; qq < kk; qq++) {
			System.out.printf("Case #%d: ",qq+1);
			
			int A = ni();
			int B = ni();
			
			int count = 0;
			
			for (int n = A; n < B; n++) {
				for (int m = n+1; m <= B; m++) {
					boolean recycled = isRecycled(n,m);
					if(recycled) {
						count++;
//						System.out.printf("(%d,%d) is recycled\n",n,m);
					}
				}
			}
			
			p(count);
			pl();
		}
	}	
	
	/**
	 * A pair is a recycled pair if you can rotate the digits of n to get m. In
	 * order words, if you let N:=string(n)+string(n) and string(m) is a
	 * substring of N, then the pair (n,m) is a recycled pair.
	 * 
	 * @param n
	 * @param m
	 * @return true if recycled pair
	 */
	public static boolean isRecycled(int n, int m) {
		String N = ""+n+n;
		String M = ""+m;
		
//		System.out.println(N);
//		System.out.println(M);
		
		return N.contains(M);
	}
}
