/*
 * 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.FileReader;
import java.io.BufferedReader;
import java.io.FileWriter;
import java.io.BufferedWriter;
	
public class RecycledNumbers {
	

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		try{
			//read file
			FileReader filein = new FileReader(args[0]);
			BufferedReader in = new BufferedReader(filein);
			//write file 
			FileWriter fileout = new FileWriter("output.txt");
			BufferedWriter out = new BufferedWriter(fileout);
			//process data
			int numcases = Integer.valueOf(in.readLine()).intValue();
			for(int i=0; i<numcases; i++){
				String[] casedata = in.readLine().split(" ");
				int minnum = Integer.valueOf(casedata[0]);
				int maxnum = Integer.valueOf(casedata[1]);
				int pos = casedata[0].length();
				int result = 0;
				for(int j=minnum; j<maxnum; j++){
					for(int k=j+1; k<=maxnum; k++){	
						if(j == k) result++;
						String numtest = String.valueOf(j);
						for(int l=0; l<pos; l++){
							char temp = numtest.charAt(0);
							numtest = numtest.substring(1)+temp;
							if(Integer.valueOf(numtest).intValue() == k){
								result++;
								break;
							}
						}
					}
				}
				out.write("Case #" + (i+1) + ": " + result + "\n");
			}
			//Close the output stream
			out.close();
			//Close the input stream
			in.close();
		}catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}
}
