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


public class RecycledNumbers {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new RecycledNumbers().fun();
	}
	
	private void fun()
	{
		String file = "D:/CodeJam/input.in";
		int result = 0;
		try {
			scan = new Scanner(new File(file));
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		
		int cases = scan.nextInt();
		
		for(int i = 1; i <= cases ; i++)
		{
			int lowLimit = scan.nextInt();
			int highLimit = scan.nextInt();
			result = findResult(lowLimit, highLimit);
			
			System.out.println("Case #"+i+": "+result);
		}
	}
	
	private int findResult(int lowLimit, int highLimit)
	{
		if(highLimit < 10)
			return 0;
		
		int[] lowArr = null;
		int count = 0;
		int shift = 0;
		ArrayList list = new ArrayList();
		for(int i = lowLimit; i <= highLimit; i++)
		{
			list.clear();
			lowArr = toArray(i);
			for(int j = 0; j < lowArr.length-1; j++)
			{
				int[] shiftArr = shift(lowArr);
				if(lowArr.length == shiftArr.length)
				{
					shift = arrayToInt(shiftArr);
					if(i < shift && shift >= lowLimit && shift <= highLimit)
					{
						if(!list.contains(shift))
						{
							list.add(shift);
							count++;
						}
					}
				}
			}
		}
		return count;
	}
	
	private int[] shift(int[] array)
	{
		int i = 0;
		
		int temp = array[array.length-1];
		for(i = array.length-1 ; i > 0; i--)
		{
			array[i] = array[i-1];
		}
		array[0] = temp;
		return array;
	}
	
	private int arrayToInt(int[] array)
	{
		int result = 0;
		for(int i =0; i < array.length ; i++)
		{
			result = array[i] + result * 10;
		}
		return result;
	}
	
	private int[] toArray(int value)
	{
		int array[] = new int[100];
		
		int count = 0;
		while(value > 0)
		{
			int temp = value % 10;
			value = value / 10;
			
			array[count++] = temp;
		}
		int array2[] = new int[count];
		int j = count - 1;
		
		for(int i = 0; i < count ; i++ , j--)
		{
			array2[j] = array[i];
		}
		
		return array2;
	}
	Scanner scan = null;
}
