/*
 * 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.awt.geom.*;
import java.io.*;
import java.math.*;
import java.util.*;
import java.util.regex.*;
import static java.lang.Math.*;

public class Main {
	public Main() throws IOException {
		String input;
		int t;

		input = br.readLine();
		t = Integer.valueOf(input);

		for (int i = 0; i < t; i++) {
			if (i > 0)
				sb.append("\r\n");

			input = br.readLine();
			work(input, i);
		}

		System.out.print(sb);
	}

	private int rightShiftDec(int num) {
		int num2 = 10;

		if (num < 10)
			return num;

		while (true) {
			if (num < num2)
				break;

			num2 *= 10;
		}

		return num / 10 + (num % 10) * num2 / 10;
	}

	private void work(String input, int t) {
		//debug(input);
		int ret = 0;
		String[] inputArray = input.split(" ");
		int min = Integer.valueOf(inputArray[0]);
		int max = Integer.valueOf(inputArray[1]);
		boolean[] doneList = new boolean[2000000];
		int total;

		for (int i = min; i <= max; i++)
			doneList[i] = false;

		for (int i = min; i <= max; i++) {
			int num = i;
			int multiply = 1;

			if (doneList[i])
				continue;

			doneList[i] = true;

			while (true) {
				num /= 10;

				if (num == 0)
					break;

				multiply *= 10;
			}

			num = i;

			total = 0;

			while (true) {
				num = num / 10 + (num % 10) * multiply;
				//debug("i:", i, " num:", num);

				if (num < multiply)
					continue;

				if (num == i)
					break;

				if ((min <= num) && (num <= max)) {
					//debug("i:", i, " num:", num, " 1111");
					total++;
					doneList[num] = true;
				}
			}

			ret += (total + 1) * total / 2;
		}

		sb.append("Case #");
		sb.append(String.valueOf(t + 1));
		sb.append(": ");
		sb.append(String.valueOf(ret));
	}

	StringBuilder sb = new StringBuilder();
	BufferedReader br = new BufferedReader(
		new InputStreamReader(System.in));

	public static void main(String[] args) throws IOException {
			new Main();
	}

	public static void debug(Object... arr) {
		System.err.println(Arrays.deepToString(arr));
	}
}
