/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */

package year_2012.qualification;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.HashSet;
import java.util.Set;

/**
 *
 * @author paul
 * @date 14 Apr 2012
 */
public class QuestionC {

    private static Set<Integer> getCycle(int x) {

        String s = Integer.toString(x);
        Set<Integer> set = new HashSet<Integer>();
        set.add(x);
        for (int c = 1; c < s.length(); c++) {
            String t = s.substring(c).concat(s.substring(0, c));
            set.add(Integer.parseInt(t));
        }
        return set;
        
    }

    private static Set<Integer> mask(Set<Integer> set, int a, int b) {
        Set<Integer> result = new HashSet<Integer>();

        for (int x : set) {
            if (x >= a && x <= b) {
                result.add(x);
            }
        }
        
        return result;

    }


    public static void main(String[] args) throws FileNotFoundException, IOException {

        String question = "C";

//        String name = "large";
        String name = "small-attempt0";
//        String name = "test";

        String filename = String.format("%s-%s", question, name);

        BufferedReader input = new BufferedReader(
                new FileReader(String.format("/home/paul/Documents/code-jam/2012/qualification/%s.in",
                filename)));

        String firstLine = input.readLine();

        PrintWriter pw = new PrintWriter(new File(
                String.format("/home/paul/Documents/code-jam/2012/qualification/%s.out", filename)));


        int T = Integer.parseInt(firstLine);

        // Loop through test cases.
        for (int i = 0; i < T; i++) {

//             Read data.
            String[] tokens = input.readLine().split(" ");

//            int N = Integer.parseInt(input.readLine());

            int A = Integer.parseInt(tokens[0]);
            int B = Integer.parseInt(tokens[1]);

//            System.out.format("%d, %d\n", A, B);

            boolean[] used = new boolean[B+1];
            int total = 0;
            for (int n = A; n <= B; n++) {
                if (!used[n]) {
                    Set<Integer> set = mask(getCycle(n), A, B);
                    int k = set.size();
                    total += (k * (k-1))/2;
                    for (int m : set) {
                        used[m] = true;
                    }
                }
            }

            pw.format("Case #%d: %d\n", i + 1, total);
        }

        pw.close();

    }

}

import java.io.File;
import java.io.FileNotFoundException;
import java.util.LinkedList;
import java.util.Scanner;


public class RecycledNumbers {

	public static int getlength(int number)
	{
		int size = 1;
		number = number/10;
		while (number!=0)
		{
			size++;
			number = number/10;
		}
		
		return size;
	}
	
	public static void main(String[] args) throws FileNotFoundException {
		
		Scanner s = new Scanner (new File("C-small-attempt0.in")); 
//				(System.in);
		int i = s.nextInt();
		int a,b,sa,c,cnt,r;
		LinkedList<Integer> ll;
		for(int j = 0 ;  j < i ; j++)
		{
			a = s.nextInt();
			b = s.nextInt();
			sa = getlength(a);
			cnt = 0;
			for( int k = a ; k <= b; k++)
			{
				r = k;
				ll = new LinkedList<Integer>();
				if(getlength(r)>1)
				for (int l = 0 ; l < sa-1 ; l++)
				{
					c = r/(int)Math.pow(10, sa-1);
					r = (r-c*(int)Math.pow(10, sa-1))*10+c;
					if(r<=b&&r>k&&!ll.contains(r))
					{
					ll.add(r);	
					cnt++;
					}
				}
			}
			System.out.println("Case #"+(j+1)+": "+(cnt));
		}
		
		
	}
	
}
