/*
 * 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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Scanner;


public class Recycled {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		
		String inStr = null;
		int numCases = 0;
		
		
		try {
			inStr = br.readLine();
			numCases = Integer.parseInt(inStr);
			for (int i = 0; i < numCases; i++) {
				inStr = br.readLine();
				System.out.println("Case #" + (i+1) + ": " + checkNums(inStr));
			}
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	}
	
	public static int checkNums(String s) {
		int [] n, m;
		int length, A, B;

		int result = 0;
		Scanner ints = new Scanner(s);
		
		A = ints.nextInt();
		B = ints.nextInt();
		
		length = (s.length()-1) / 2;
				
		n = new int[length];
		m = new int[length];
		
		for (int i = A; i < B; i++) {
			for (int j = i+1; j <= B; j++) {
				String nStr = "" + i;
				String mStr = "" + j;
				
				for (int x = 0; x < length; x++) {
					n[x] = nStr.charAt(x) - 48;
					m[x] = mStr.charAt(x) - 48;
				}
				for (int x = 0; x < length - 1; x++) {
					int tempInt = n[length - 1];
					for (int y = length - 1; y > 0; y--) {
						n[y] = n[y-1];
					}
					n[0] = tempInt;
					if (isEqual(n, m, length)) {
						result++;
						break;
					}
				}
				
				
				
				
			}
		}
		

		return result;
	}
	
	public static Boolean isEqual(int[] m, int [] n, int length) {

		for (int i = 0; i < length; i++) {
			if (n[i] != m[i]) return false;
		}
		
		return true;
	}

}
