/*
 * 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;
    }

}


public class RecycledNumbers {

	public RecycledNumbers() {
	}
	
	public int sumOfDigit (int x)
	{
		int sum = 0;
		while (x >0) 
		{
			sum+=x%10;
			x /=10;
		}
		return sum ;
	}
	
	String n ;
	String m ;
	String temp1_1 ;
	
	public boolean Recycled(int x,int y,int begin) // y > x 
	{
		if (x == y)
			return false ;
		
		if (sumOfDigit(x) != sumOfDigit(y))
			return false ;
		
		n = x+"" ;
		temp1_1 = x+"" ;
		m = y+"" ;
		
		
		while (begin< n.length() && n.charAt(begin) != m.charAt(0))
			begin++;
		
//		System.out.println("i = " + begin);
		
		if (begin == n.length())
			return false ;
		
		n = n.substring(begin);
		n += temp1_1.substring(0,begin);
		
//		System.out.println("1 = " + n);
//		System.out.println("2 = " +m);
		
		if (n.equals(m))
			return true ;
		if (begin<n.length())
			return Recycled(x, y, begin+1);
		else
			return false ;
	}
	
	public int numOfDisRecNum (int min , int max)
	{
		int counter = 0 ;
		
		for (int n =min;n<max;n++)
			for (int m=n+1 ;m<= max ;m++)
			{
				if (Recycled(n,m,0))
					counter ++ ;
			}
		
		return counter;
	}
	public static void main(String[] args) {
		
		RecycledNumbers obj = new RecycledNumbers();
		
		System.out.println(obj.numOfDisRecNum(1111 , 2222));
		
//		System.out.println(obj.Recycled(244,424,0));
		
//		System.out.println(obj.Recycled(12345,34512,0));
		
	}
}

