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

public class jam03 {

	/**
	 * @param args
	 */
	
	public static void main1(){
	// scalar product problem
	}
	
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		
		int number_test;
		Scanner sc = new Scanner(System.in);
		number_test = sc.nextInt();
		for(int j=1;j<=number_test;j++) {
			int lowerLimit = sc.nextInt();
			int upperLimit = sc.nextInt();
			System.out.print("Case #" + j + ": ");
			action(lowerLimit,upperLimit);
//			System.out.println(sum);
		}
	}


	private static void action(int lowerLimit, int upperLimit ) {
		// TODO Auto-generated method stub
		// Iterating over the elements in the set
		int finalGuys = 0;
		int maxZeroes = 0;
		int oldNum=0;
//		System.out.println("lower"+ lowerLimit);
//		System.out.println("uper"+upperLimit);
		for(int i=lowerLimit;i<upperLimit;i++)
		{			
			for(int k=4;k>=1;k--)
			{//3422
				int temp = (int) (i/Math.pow(10, k));//34
				if(maxZeroes ==0 && temp > 0)
				{
					maxZeroes = k;
					//System.out.println("maxZeroes"+maxZeroes);
				}
				if(maxZeroes>0)
				{
					int temp1 = (int) (i - (temp*Math.pow(10, k)));//3422-3400
					int newNum = (int) ((temp1*Math.pow(10, maxZeroes-k+1))+temp);//4223
					if(newNum <= upperLimit && newNum > i && newNum != oldNum)
					{
						oldNum = newNum;
						finalGuys++;
					}
				}
			}
		}
		System.out.println(finalGuys);
			
	}
}
