/*
 * 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.*;
import java.util.*;

public class C {

	public static void main(String[] args) throws IOException {
               	//variable initialization
                String inFile = args[0];
		String outFile = inFile.split("\\.")[0] + ".out";

                //file reading...
                BufferedReader reader = new BufferedReader(new FileReader(inFile));
                PrintWriter writer = new PrintWriter(new FileWriter(outFile));

		//get input data
		int T = Integer.valueOf(reader.readLine());
		for (int t = 0; t < T; t++) {
			String[] str_nums = reader.readLine().split(" ");
			int A = Integer.valueOf(str_nums[0]);
			int B = Integer.valueOf(str_nums[1]);
			int count = 0;
			// for (int i = 1; i < 5; i++) {
			// 	for (int j = i+1; j < 5; j++) {
			// 		for (int k = 0; k < 10; k++) {
			// 			if (k == i || k == j) continue;
			// 			int shift = 1;
			// 			int n = i*100 + k*10 + j;
			// 			int m = n % (int)Math.pow(10, shift) * (int)Math.pow(10, 3 - shift)
			// 			      + n / (int)Math.pow(10, shift); 	
			// 			count++;
			// 			System.out.print(n + "->" + m + ", ");

			// 			shift = 2;
			// 			n = i*100 + j*10 + k;
			// 			m = n % (int)Math.pow(10, shift) * (int)Math.pow(10, 3 - shift)
			// 			      + n / (int)Math.pow(10, shift); 	
			// 			count++;
			// 			System.out.print(n + "->" + m + ", ");
			// 			
			// 		}
			// 		System.out.println();
			// 	}
			// }
			int digits = String.valueOf(A).length();
			for(int i = A; i < B; i++) {
				//Set<Character> chars = new HashSet<Character>();
				//for (char c : String.valueOf(i).toCharArray()) chars.add(c);
				//if (chars.size() != digits) continue;
				Set<Integer> olds = new HashSet<Integer>();
				for (int shift = 1; shift < digits; shift++) {
					int n = i;
					int m = n % (int)Math.pow(10, shift) * (int)Math.pow(10, digits - shift)
					      + n / (int)Math.pow(10, shift); 	
					if (m < A || m > B || n >= m) continue;
					if (olds.contains(m)) continue;
					olds.add(m);
					count++;
					// if (t == 3) System.out.print(n + "->" + m + ", ");
				}
			}
			String result = "Case #" + (t+1) + ": " + count;
			writer.println(result);
			System.out.println(result);
		}
		reader.close();
		writer.close();		
	}
}
