/*
 * 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.FileReader;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.util.HashMap;
import java.util.LinkedList;

class RecycledNumbers {

	public static void main(String[] args) throws Exception {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		System.out.println("Input? ");
		String input = in.readLine();
		if(!input.equals("System.in")) {
			in = new BufferedReader(new FileReader(new File(input)));
		}
		
		PrintStream out;
		out = new PrintStream(new File("C.out"));
		//out = System.out;
		
		int cases = Integer.parseInt(in.readLine());
		
		for(int i = 1; i <= cases; i++) {
			String[] line = in.readLine().split(" ");
			
			int A = Integer.parseInt(line[0]);
			int B = Integer.parseInt(line[1]);
			
			int recycledPairs = 0;
			HashMap<Integer,LinkedList<Integer>> cache = new HashMap<Integer,LinkedList<Integer>>();
			for(int n = A; n < B; n++) {
				String nStr = Integer.toString(n);
				for(int wrap = 0; wrap < nStr.length(); wrap++) {
					String mStr = recycle(nStr, wrap);
					int m = Integer.parseInt(mStr);
					if(A <= n && n < m && m <= B) {
						System.out.println(A + "<=" + nStr + "<" + mStr + "<=" + B);
						if(cache.get(n) == null) {
							cache.put(n, new LinkedList<Integer>());
							cache.get(n).add(m);
							recycledPairs++;
						}
						else if(!cache.get(n).contains(m)) {
							cache.get(n).add(m);
							recycledPairs++;
						}
					}
				}
			}
			
			out.print("Case #" + i + ": " + recycledPairs);
			if(i != cases) out.println();
		}
		
		if(out != System.out) out.close();
	}
	
	public static String recycle(String number, int offset) {
		offset = offset > number.length() - 1 || offset < 0 ? offset % number.length() : offset;
		if(offset == 0) return number;
		
		char[] oldNumber = number.toCharArray();
		char[] newNumber = new char[number.length()];
		
		System.arraycopy(oldNumber, offset, newNumber, 0, number.length() - offset);
		System.arraycopy(oldNumber, 0, newNumber, number.length() - offset, offset);
		
		return new String(newNumber);
	}
}