/*
 * 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();

    }

}

//package com.GoogleCodeJam.y2012.Qualification.RecycledNumbers;

import java.io.BufferedReader;
import java.io.File;
import java.io.FileNotFoundException;
import java.io.FileReader;
import java.io.IOException;
import java.util.HashSet;
import java.util.Set;

public class RecycledNumbers {
	public static void main(String[] args) {
		try {
			BufferedReader in = new BufferedReader(new FileReader(new File("C-small-attempt0.in")));
			int numberOfCases = Integer.parseInt(in.readLine());
			for (int caseNumber = 1; caseNumber <= numberOfCases; caseNumber++) {
				String[] bounds = in.readLine().split(" ");
				int min = Integer.parseInt(bounds[0]);
				int max = Integer.parseInt(bounds[1]);
				int number = getNumber(min, max);
				System.out.println("Case #" + caseNumber + ": " + number);
			}
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		} catch (NumberFormatException e) {
			e.printStackTrace();
		} catch (IOException e) {
			e.printStackTrace();
		}
		
	}

	public static int getNumber(int min, int max) {
		int sum = 0;
		int length = (min+"").length();
		for (int i=min; i<=max; i++) {
			if (isMinimalRotation(i, min, max, length)) {
				sum += getNumberOfPairs(i, min, max, length);
			}
		}
		return sum;
	}

	public static boolean isMinimalRotation(int posit, int min, int max, int length) {
		String doubledIn = posit + "" + posit;
		for (int j = 0; j<length; j++) {
			int theorem = Integer.parseInt((String) doubledIn.subSequence(j, j+length));
			if (theorem >= min && theorem < posit) {
				return false;
			}
		}
		return true;
	}
	public static int getNumberOfPairs(int posit, int min, int max, int length) {
		Set<String> seen = new HashSet<String>();
		String doubledIn = posit + "" + posit;
		int counted = 0;
		for (int j = 0; j<length; j++) {
			String subSequence = (String) doubledIn.substring(j, j+length);
			int theorem = Integer.parseInt(subSequence);
			if (theorem >= min && theorem <= max && !seen.contains(subSequence)) {
				seen.add(subSequence);
				counted += 1;
			}
		}
		if (counted == 1) {
			return 0;
		}
		if (counted == 2) {
			return 1;
		}
		if (counted == 3) {
			return 3;
		}
		if (counted == 4) {
			return 6;
		}
		if (counted == 5) {
			return 10;
		}
		if (counted == 6) {
			return 15;
		}
		if (counted == 7) {
			return 21;
		}
		return counted*(counted-1)/2;
	}
}
