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

public class recycled
{
	public static void main(String[] args) throws IOException
	{
		BufferedReader baca= new BufferedReader(new InputStreamReader(System.in));
		int T= Integer.parseInt(baca.readLine());
		for(int i=1; i<=T; i++)
		{
			StringTokenizer token= new StringTokenizer(baca.readLine());
			int A= Integer.parseInt(token.nextToken());
			int B= Integer.parseInt(token.nextToken());
			int count=0;
			
			for(int n=A; n<B; n++)
			{
				for(int m=n+1; m<=B; m++)
				{
					count=count+hitung(n,m);
				}
			}
			System.out.println("Case #"+i+": "+count);
		}
	}
	
	public static int hitung(int n, int m)
	{
		String angka= Integer.toString(n);
		String tanda= Integer.toString(m);
		char[] sesuatu=angka.toCharArray();
		char[] acuan=tanda.toCharArray();
		for(int i=0; i<angka.length(); i++)
		{
			char temp=sesuatu[0];
			for(int j=0; j< angka.length()-1; j++)
			{
				sesuatu[j]=sesuatu[j+1];
			}
			sesuatu[angka.length()-1]=temp;
			boolean b=true;
			
			for(int z=0; z<angka.length();z++)
			{
				if(sesuatu[z]!=acuan[z])
				{
					b=false;
					break;
				}
			}
			if(b==true)
			{
				return 1;
			}
		}
		return 0;
	}	
}