/*
 * 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 RecycledNumbers {
	public static void main(String... args) throws Exception {

		BufferedReader br = new BufferedReader(
		new FileReader(System.getProperty("user.home") + "/Desktop/csmall.in")
		//new InputStreamReader(System.in)
		);

		int times = Integer.parseInt(br.readLine());

		for (int i = 0; i < times; i++) {
			numbers(br.readLine(), i+1);
		}

	}

	public static void numbers(String data, int num) {
		int a = Integer.parseInt(data.split(" ")[0]);
		int b = Integer.parseInt(data.split(" ")[1]);
		int count = 0;
		
		for (int n = a; n < b; n++) {
			String nn = n+"";
			for (int m = n+1; m <= b; m++) {
				String mm = m+"";
				if (nn.length() != mm.length()) {continue;}
				
				boolean check = false;
				for (int i = mm.length() - 1; i >= 0; i--) {
					String news = mm.substring(i);
					String newst = news + mm.substring(0, i);
					check = check(nn, newst);
					if (check) {
						count++;
						break;
					}
				}
				
			}
		}
		
		System.out.println("Case #" + num + ": " + count);
	}
	
	public static boolean check(String a, String b) {
		a = Integer.parseInt(a) + "";
		b = Integer.parseInt(b) + "";
		
		if (a.equals(b) || a.length() != b.length()) {
			return false;
		}
		
		String end = "";
		
		for (int i = b.length(); i >= 0; i--) {
			String first = b.substring(i);
			end = first + b.substring(0, i);
			
			if (a.equals(end)) {
				return true;
			}
		}
		
		return false;
	}
}
