/*
 * 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.lang.*;
import java.lang.StringBuilder;
import java.util.Arrays;
import java.lang.Integer;
//import org.apache.commons.lang.ArrayUtils;

class Recycle 
{

 public static void circularShiftLeft(char[] arr) {
        if (arr.length == 0)
            return;

        char first = arr[0];
        System.arraycopy(arr, 1, arr, 0, arr.length - 1);
        arr[arr.length - 1] = first;
		
		
    }
	
	
 public static void main(String args[])
 {
 
		/*int[] arr = { 1, 2, 3, 4 };
        System.out.println(Arrays.toString(arr));
        circularShiftLeft(arr);
        System.out.println(Arrays.toString(arr));*/
	try
  {	
  String[] toCompare;
  
  FileWriter ostream = new FileWriter("C-small-attempt0.out");
  BufferedWriter out = new BufferedWriter(ostream);
  
  FileInputStream fstream = new FileInputStream("C-small-attempt0.in");
  
  DataInputStream in = new DataInputStream(fstream);
  BufferedReader br = new BufferedReader(new InputStreamReader(in));
  String strLine;
  int count=0;
  int resultcounter = 0;
  //StringBuilder result = new StringBuilder();
  strLine = br.readLine();
  strLine = br.readLine();
  
  do{
		//toConvert = strLine.toCharArray();
		//toCompare="";
		
		StringBuilder result = new StringBuilder();
	count++;
	result.append("Case #"+count+": ");
	
		toCompare = strLine.split(" ");
		//System.out.println(toCompare.length);
	    resultcounter = 0;
		int n =  Integer.parseInt(toCompare[0]);
		int m =  Integer.parseInt(toCompare[1]);
		
		/*char [] n1 = toCompare[0].toCharArray();
		char [] m1 = toCompare[1].toCharArray();*/
		
		char [] n1;
		char [] m1; 
				//System.out.println(n+ " : "+Arrays.toString(n1));
			    //System.out.println(m+ " : "+Arrays.toString(m1));
				
		for(;n<m-1;n++)
		{
			int m2=m;
			for(;m2>n+1;m2--)
			{
					n1 = (new Integer(n)).toString().toCharArray();
					m1 = (new Integer(m2)).toString().toCharArray();
					
					for(int index=0; index<m1.length; index++)
					{
						String nn = new String(n1);
						String mm = new String(m1);
						//System.out.println("Compare : "+ nn + " -- "+mm);
						if(nn.equals(mm))
						{
								System.out.print(nn + " : " +mm+"\t");
								resultcounter++;
						}
						circularShiftLeft(n1);
					}					
					/*System.out.println("n,m : " + n + " : "+m2+ " : "+Arrays.toString(n1)+" Length: "+n1.length);
					circularShiftLeft(n1);
					System.out.println(Arrays.toString(n1));*/
			}
		}
		System.out.println("---------------------------------- " + resultcounter);
		//System.out.println("n - m" + n + m);
		
		
	result.append(resultcounter);
	out.write(result.toString());
	out.newLine();
 
  }while ((strLine = br.readLine()) != null);
out.close();
  in.close();
  }
  catch(Exception e)
  {
  System.err.println("Error: " + e.getMessage());
  }
  
}

}

