/*
 * 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.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.LinkedHashSet;
import java.util.List;

public class ProblemB {
	private static List<Integer> digits100(int i) {
		List<Integer> digits = new ArrayList<Integer>();
		while (i > 0) {
			digits.add(i % 10);
			i /= 10;
		}
		Collections.sort(digits);
		return digits;
	}

	private static List<Integer> firstDigits1000(int i) {
		List<Integer> digits = new ArrayList<Integer>();
		digits.add(i % 10);
		digits.add((i - (i % 10)) / 10);
		Collections.sort(digits);
		return digits;
	}

	private static List<Integer> secondDigits1000(int i) {
		List<Integer> digits = new ArrayList<Integer>();
		digits.add(i % 100);
		digits.add((i - (i % 100)) / 100);
		Collections.sort(digits);
		return digits;
	}

	public static void main(String[] args) throws NumberFormatException,
			IOException {

		BufferedReader br = new BufferedReader(new FileReader("C-small-attempt0.in"));
		PrintWriter out = new PrintWriter(new FileWriter("output.txt"));

		ArrayList<List<Integer>> digitsList = new ArrayList<List<Integer>>();
		LinkedHashSet<List<Integer>> digitsSet = new LinkedHashSet<List<Integer>>();

		int testCases = Integer.parseInt(br.readLine());
		for (int i = 1; i <= testCases; i++) {
			out.print("Case #"+i+": ");
			String[] str = br.readLine().split(" ");
			int int1 = Integer.parseInt(str[0]);
			int int2 = Integer.parseInt(str[1]);
			for (int j = int1; j <= int2; j++) {
				if (j < 100) {
					digitsList.add(digits100(j));
					digitsSet.add(digits100(j));
				} else if (j < 1000) {
					if (firstDigits1000(j).get(1) > 9) {
						digitsList.add(firstDigits1000(j));
						digitsSet.add(firstDigits1000(j));
					}
					if (!firstDigits1000(j).equals(secondDigits1000(j))
							&& secondDigits1000(j).get(1) > 9) {
						digitsList.add(secondDigits1000(j));
						digitsSet.add(secondDigits1000(j));
					}

				}
			}
			out.println(digitsList.size() - digitsSet.size());
			for (List<Integer> li : digitsSet) {
				digitsList.remove(digitsList.indexOf(li));
			}
			System.out.println(digitsList.toString());
			System.out.println(digitsList.size());
			// System.out.println(digitsSet.toString());
			// System.out.println(firstDigits1000(100));
			// System.out.println(secondDigits1000(100));
			digitsSet.clear();
			digitsList.clear();
		}

		out.close();
	}

}
