/*
 * 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.FileInputStream;
import java.io.FileNotFoundException;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.OutputStreamWriter;
import java.io.Writer;
import java.util.ArrayList;
import java.util.Scanner;


public class RecycledNumbers {
	
	static ArrayList<intMapping> included;
	
	public static void main(String[] args) {
//		Scanner sc = new Scanner(System.in);
		Scanner sc;
		try {
			sc = new Scanner(new FileInputStream("C-small-attempt0.in"));
		} catch (FileNotFoundException e) {
			sc = new Scanner(System.in); // file not exist, so get input from console
		}

		Writer out;
		try {
			out = new OutputStreamWriter(new FileOutputStream("C-small.out"));
		} catch (FileNotFoundException e) {
			out = new OutputStreamWriter(System.out); // use console
		}
		
		int T = sc.nextInt();
//		sc.nextLine();
		
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt(), B = sc.nextInt();
			int count = 0;
			included = new ArrayList<intMapping>();
			
			for (int max = B; max > A; max--) {
				count += countShitMatches(max, A);
			}
			
			// output
			System.out.println("Case #" + (t + 1) + ": " + count);
			try {
				out.write("Case #" + (t + 1) + ": " + count + "\n");
			} catch (IOException e) {
				// do nothing
			}
		}

		try {
			out.close();
		} catch (IOException e) {
			// do nothing
		}
	}

	static int countShitMatches(Integer input, int min) {
		int count = 0;
		String number = input.toString();
		for (int i = 1; i < number.length(); i++) {
			number = digitShift(number);
			int result = Integer.parseInt(number);
			if (result >= min && result < input)
				if (!mappingExists(input, result)) {
					included.add(new intMapping(input, result));
					count++;
			}
		}
		
		return count;
	}
	
	static String digitShift(String input) { // moves first digit to end of number represented by a String
		return input.substring(1).concat(input.substring(0, 1));
	}
	
//	static Boolean mappingExists(Integer k, Integer v) {
//		return included.contains(new intMapping(k, v));
//	}

//	static Boolean mappingExists(Integer k, Integer v) {
//		intMapping test = new intMapping(k, v);
//		
//		for (intMapping m : included) {
//			if (m.equals(test))
//				return true;
//		}
//		
//		return false;
//	}
	
	static Boolean mappingExists(Integer k, Integer v) {
		for (intMapping m : included) {
			if (m.key == k && m.value == v)
				return true;
			if (m.key == v && m.value == k)
				return true;
		}
		
		return false;
	}
	
	static class intMapping { //implements Comparable<intMapping> {
		public int key, value;
		
		public intMapping(int k, int v) {
			key = k;
			value = v;
		}

//		@Override
//		public int compareTo(intMapping other) {
//			if ((other.key == this.key && other.value == this.value) || (other.key == this.value && other.value == this.key))
//				return 0;
//			else return 1;
//		}
	}
}
