/*
 * 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.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.HashMap;
import java.util.HashSet;
import java.util.List;
import java.util.Map;
import java.util.Set;


public class RecycleNumbers {
	
	private static final Map<Integer,Integer> power = new HashMap<Integer,Integer>();
	
	static{
		power.put(0,1);
		power.put(1,10);
		power.put(2,100);
		power.put(3,1000);
		power.put(4,10000);
		power.put(5,100000);
		power.put(6,1000000);
	}
	
	private static int recycle(int b , int max)
	{
		int size =0 ,ret = 0;
		int a = b , rem = 0 , i = 0;
		while((size++ > -1) && ((a = a/10)!= 0));
		a = b;
		int myPower = power.get(size -1);
		Set<Integer> mySet = new HashSet<Integer>();
		for(i = 0 ; i < size-1; i++)
		{
			rem = a%10;
			a = rem * myPower + a/10;
			if(a > b && a <= max && !mySet.contains(a)) ret++;
			mySet.add(a);
		}
		return ret;
	}
	
	public static void main(String[] args) throws IOException {
		if (args.length < 2) {
			System.err.println("Please enter the Valid I/O Paths in the argument ");
			System.err.println("First Input , then OutPut ");
			System.exit(0);
		}
		File inFile = new File(args[0]);
		File outFile = new File(args[1]);
		BufferedReader in = new BufferedReader(new InputStreamReader(
				new FileInputStream(inFile)));
		PrintWriter out = new PrintWriter(new FileOutputStream(outFile));
		String myLine = in.readLine();
		int t = Integer.parseInt(myLine);
		int caseNum = 1 , result;
		int a , b;
		while (t-- > 0) {
			myLine = in.readLine();
			String[] myStr = myLine.split(" ");
			a = Integer.parseInt(myStr[0]);
			b = Integer.parseInt(myStr[1]);
			result = 0;
		    for(int i = a ; i < b ; i++)
		    	result += recycle(i,b);
			out.println("Case #" + (caseNum) + ": " + result);
			caseNum++;
		}
		out.close();
	}
}
