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

public class RecycledNumbers extends Thread
{
	private int bottom;
	private int top;
	private static int numCases;
	private static int caseIndex = 0;
	private static int lower[];
	private static int upper[];
	private long thisCount = 0;
	
	public static void main(String[] args) 
	{
		
		int n = 1;

		long startTime = System.currentTimeMillis();

		for (int i = 1; i < args.length; i++)
		{
			if(args[i - 1].equals("-n"))
			{
				try
				{
					n = Integer.parseInt(args[i]);
				}
				catch (Exception e)
				{

				}
			}
		}
		
		//System.out.println(n + " threads will be used.\n");

		//GATHER INPUT
		Scanner sc = new Scanner(System.in);
		 numCases = sc.nextInt();
		 int currentCaseNum = 1;
		 String[] outputBuffer = new String[numCases];
		 
		 lower = new int[numCases];
		 upper = new int[numCases];
		 
		 sc.nextLine();
		 for(int i = 0; i < numCases; i++)
		 { 
			 lower[i] = sc.nextInt();
			 upper[i] = sc.nextInt();
			 			 
		 }

		for(int m = 0; m < numCases; m++)
		{
			Thread[] threadArray = new Thread[n];
			RecycledNumbers[] speedupArray = new RecycledNumbers[n];

			int nextLower = lower[m];
			int nextUpper = ((upper[m] - lower[m]) / n) + lower[m];
			for (int j = 0; j < n; j++)
			{
				speedupArray[j] = new RecycledNumbers(nextLower, nextUpper);
				threadArray[j] = new Thread(speedupArray[j]);
				threadArray[j].start();
				nextLower = nextUpper + 1;
				nextUpper = ((j + 2) * (upper[m] - lower[m]) / n) + lower[m];
			}

			for (int k = 0; k < threadArray.length; k++)
			{
				try
				{
					threadArray[k].join();
				} 
				catch (InterruptedException e) {}
			}
			
			int totalCount = 0;
			
			for (int k = 0; k < threadArray.length; k++)
			{
				totalCount += speedupArray[k].thisCount;
			}

			System.out.println("Case #" + (m + 1) + ": " + totalCount);
			//System.out.println("");
		}
		
		//System.out.println("\nDONE!  Execution time of " + ((double)(System.currentTimeMillis() - startTime) / 1000) + " seconds.");
	}
	
	
	public RecycledNumbers(int rangeBottom, int rangeTop)
	{
		bottom = rangeBottom;
		top = rangeTop;
		//System.out.println("This class instance will handle " + bottom + " to " + top + ".");
	}

	private long countDistinct(int lowerBound, int upperBound)
	{
		long count = 0;
		
		for(int i = lowerBound; i < upperBound; i++)
		{
			count += countUniquePermutations(i, upperBound);
		}

		return count;
	}
	
	private int countUniquePermutations(int subject, int topBound)
	{
		int count = 0;
		String intString = Integer.toString(subject);
		String tempNewString = "";
		int tempNewInt = 0;
		int tempIntLength = 0;
		int[] distinctInt = new int[intString.length() - 1];
		
		for(int j = 1; j < intString.length(); j++)
		{
			tempNewString = intString.substring(j, intString.length()) + intString.substring(0, j);
			tempNewInt = Integer.parseInt(tempNewString);
			tempIntLength = Integer.toString(tempNewInt).length();
			
			if((intString.length() == tempIntLength) && (subject != tempNewInt) && (tempNewInt >= subject) && (tempNewInt <= topBound))
			{
				distinctInt[j -1] = tempNewInt;				
			}
			
			Set<Integer> s = new HashSet<Integer>();
			for (int i : distinctInt)
			{
				if(i != 0)
				{
					s.add(i);
				}
			}
			count = s.size();
		}
		
		return count;
	}
	
	public void run()
	{
		thisCount = countDistinct(bottom, top);
	}

}
