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


public class Utils {
	
	private static void quickAscSort(ArrayList list, int low0, int high0) {

		int low = low0, high = high0;

		if (low >= high) {

			return;

		} else if (low == high - 1) {

			if (((Comparable)list.get(low)).compareTo(list.get(high)) > 0) {

				Object temp = list.get(low);

				list.set(low, list.get(high));

				list.set(high, temp);

			}

			return;

		}

		

		Object pivot = list.get((low + high) / 2);

		list.set((low + high) / 2, list.get(high));

		list.set(high, pivot);

		

		while (low < high) {

			while (((Comparable)list.get(low)).compareTo(pivot) <= 0 && low < high) {

				low++;

			}

			while (((Comparable)list.get(high)).compareTo(pivot) >= 0 && low < high) {

				high--;

			}

			if (low < high) {

				Object temp = list.get(low);

				list.set(low, list.get(high));

				list.set(high, temp);

			}

		}

		list.set(high0, list.get(high));

		list.set(high, pivot);

		quickAscSort(list, low0, low - 1);

		quickAscSort(list, high + 1, high0);

	}

	
	private static void quickDescSort(ArrayList list, int low0, int high0) {

		int low = low0, high = high0;

		if (low >= high) {

			return;

		} else if (low == high - 1) {

			if (((Comparable)list.get(low)).compareTo(list.get(high)) > 0) {

				Object temp = list.get(low);

				list.set(low, list.get(high));

				list.set(high, temp);

			}

			return;

		}

		

		Object pivot = list.get((low + high) / 2);

		list.set((low + high) / 2, list.get(high));

		list.set(high, pivot);

		

		while (low < high) {

			while (((Comparable)list.get(low)).compareTo(pivot) >= 0 && low < high) {

				low++;

			}

			while (((Comparable)list.get(high)).compareTo(pivot) <= 0 && low < high) {

				high--;

			}

			if (low < high) {

				Object temp = list.get(low);

				list.set(low, list.get(high));

				list.set(high, temp);

			}

		}

		list.set(high0, list.get(high));

		list.set(high, pivot);

		quickDescSort(list, low0, low - 1);

		quickDescSort(list, high + 1, high0);

	}
	

	public static void sortAscList(ArrayList list) {

		Collections.sort(list) ;
	

	}
	
	public static void sortDescList(ArrayList list) {

		Collections.sort(list,Collections.reverseOrder()) ;

	}
	
	public static ArrayList<String> toStrArrayList(String str)
	{
      StringTokenizer stTokenizer = new StringTokenizer(str) ;
		
		ArrayList<String> readStrList = new ArrayList<String>(stTokenizer.countTokens()) ; 
		
		while(stTokenizer.hasMoreTokens())
		{
			readStrList.add(stTokenizer.nextToken()) ;
		}
		
		return readStrList ; 
	}

	
	public static ArrayList<Integer> toIntArrayList(String str)
	{
      StringTokenizer stTokenizer = new StringTokenizer(str) ;
		
		ArrayList<Integer> readIntList = new ArrayList<Integer>(stTokenizer.countTokens()) ; 
		
		while(stTokenizer.hasMoreTokens())
		{
			readIntList.add(Integer.parseInt(stTokenizer.nextToken())) ;
		}
		
		return readIntList ; 
	}
	
	public static void printArrayList(ArrayList list,String seperator)
	{
         ListIterator iterator = list.listIterator() ;
		
		while(iterator.hasNext())
		{
			System.out.print(iterator.next()) ;
			if(iterator.hasNext()) System.out.print(seperator) ;
			
		}
		
		System.out.print("\n"); 
		
	}
	
	
	public static void reverseArrayList(ArrayList list)
	{
     Collections.reverse(list) ; 
		
	}
	
	
}
 
 

	

