/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package recycled;

import java.io.BufferedReader;
import java.io.DataInputStream;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.TreeSet;

/**
 *
 * @author Alfred
 */
public class Main {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
    try {
            FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
            DataInputStream in = new DataInputStream(fstream);
            BufferedReader br = new BufferedReader(new InputStreamReader(in));
            FileWriter outFile = new FileWriter("out.txt");
            PrintWriter out = new PrintWriter(outFile);
            String line;
            line = br.readLine();
            int cases = Integer.parseInt(line);
            for (int i=1; i<=cases;i++){
                line = br.readLine();
                String[] values = line.split(" ");
                int A = Integer.parseInt(values[0]);
                int B = Integer.parseInt(values[1]);
                int total=0;
                for (int n=A; n<=B;n++){
                    TreeSet<String> solutions = new TreeSet<String>();
                    for (int k=1;k<values[1].length();k++){
                        String m = circshift(n,k);
                        int mVal = Integer.parseInt(m);
                        if(mVal<=B && mVal!=n  && mVal> n && !m.startsWith("0") && m.length()==Integer.toString(n).length() )
                        {
                            solutions.add(m);
                        }                   
                    }
                    total+=solutions.size();
                }
                out.println("Case #"+i+": "+total);
            }
            in.close();
            out.close();
        } catch (Exception e) {//Catch exception if any
            System.err.println("Error: " + e.getMessage());
        }

}

    private static String circshift(int n, int k) {
        String nString=Integer.toString(n);
        int len=nString.length();
        String m =  nString.substring(len-k)+nString.subSequence(0, len-k);
        //System.out.println(n+" "+m);
        return m;
    }

}


import java.io.BufferedReader;
import java.io.FileInputStream;
import java.io.InputStreamReader;
import java.util.HashSet;
import java.util.Set;


public class RecycleNumber {

	/**
	 * @param args
	 */
	public static void main(String[] args) throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(new FileInputStream(".in")));
		int num =0;
		String line = null;
		line = br.readLine();
		int i=0;
		num = Integer.parseInt(line);
		
		while(num-->0){
			int result = 0;
			line = br.readLine();
			i++;
			String[] nums = line.split(" ");
			int min = Integer.parseInt(nums[0]);
			int max = Integer.parseInt(nums[1]);
			
			for(int t=min;t<=max;t++){
				result += countRecyles(t,min,max);
			}
			
			System.out.println("Case #"+i+": "+result/2);
			
		}
		br.close();
	}
	
	public static int countRecyles(int num,int min,int max){
		int count = 0;
		Set<Integer> result = getNums(num);
		for(int i:result){
			if(i>=min&&i<=max){
				count++;
			//	System.out.println(num+","+i);
			}
			
		}
		
		return count;
	}
	
	public static Set<Integer> getNums(int num){
		Set<Integer> list = new HashSet<Integer>();
		
		StringBuilder sb = new StringBuilder(num+"");
		for(int i=0;i<sb.length();i++){
			char last = sb.charAt(sb.length()-1);
			sb.deleteCharAt(sb.length()-1);
			sb.insert(0, last);
			if(last!='0'){
				int tmp = Integer.parseInt(sb.toString());
				if(tmp != num)
					list.add(tmp);
			}
		}
		
		return list;
	}
	

}
