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

public class RecycledNumbers {
	
	public static void main(String args[]){
		RecycledNumbers r= new RecycledNumbers();
		r.convert(args[0]);
	}
	

	public void convert(String filename){
		try{
		File f= new File(filename);
		Scanner scan= new Scanner(f);
	   String firstLine= scan.nextLine();
	   int num= Integer.parseInt(firstLine);
	   int[] answer= new int[num];
	   int[][] testnum= new int[num][2];
	   
	   for(int i=0; i<num;i++){
		   int count= 0;
		String line= scan.nextLine();	
		String[] array = line.split(" ");
		 int[] pair= new int[]{Integer.parseInt(array[0]), Integer.parseInt(array[1])};
		 testnum[i]= pair;
		 
		 for (int k=pair[0];k<=pair[1];k++){
			 String strNum= ""+ k;
			 
			 for(int l= strNum.length()-1;l>0;l=l-1){
				 String pos= strNum.substring(l,strNum.length())+strNum.substring(0,l);
				 int j= Integer.parseInt(pos);
				 if (j<=pair[1] && j>=pair[0] && j>k){
					 count=count+1;
				 }
			 }
		 }
		 answer[i]= count;
		 System.out.println("Case #"+(i+1)+": "+count);
	   }
		}
	   catch(FileNotFoundException e){
		   }	
	   }
	

	}