/*
 * 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.BufferedWriter;
import java.io.DataInputStream;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileWriter;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;


public class ProblemC {
	public static void main(String [] args){
		doIt();
	}

	public static void doIt(){

		try{
			BufferedWriter out = new BufferedWriter(new FileWriter("C-small-attempt0.out"));
			FileInputStream fstream = new FileInputStream(new File("C-small-attempt0.in"));
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine;
			int testLines = Integer.parseInt(br.readLine());
			int caseCounter = 0;
			while ((strLine = br.readLine()) != null) {
				int possibs = 0;
				String[] str = strLine.split(" ");
				List<Integer> numbers = new ArrayList<Integer>();
				int  small = Integer.parseInt(str[0]);
				int  large = Integer.parseInt(str[1]);
				System.out.println(small + " " + large);
				for (int i = small ; i <= large ; i++){
					numbers.add(i);
				}
				for(int n : numbers){
					int len = String.valueOf(n).length();
					if (len == 1) continue;
					if (len == 2 && (String.valueOf(n)).substring(1, 2) != "0") {
						String strN = (String.valueOf(n)).substring(1, 2) + (String.valueOf(n)).substring(0, 1);
						System.out.println(strN);
						if (n < Integer.parseInt(strN) && Integer.parseInt(strN) <= large){
							possibs++;
						}
					}
					else if (len == 3) {
						String strN = (String.valueOf(n)).substring(2, 3) + (String.valueOf(n)).substring(0, 2);
						if (n < Integer.parseInt(strN) && Integer.parseInt(strN) <= large && (String.valueOf(n)).substring(2, 3) != "0"){
							possibs++;
						}
						String strNN = (String.valueOf(n)).substring(1, 3) + (String.valueOf(n)).substring(0, 1);
						if (n < Integer.parseInt(strNN) && Integer.parseInt(strNN) <= large && (String.valueOf(n)).substring(1, 2) != "0"){
							possibs++;
						}
					}
					else if (len == 4) {
						String strN = (String.valueOf(n)).substring(3, 4) + (String.valueOf(n)).substring(0, 3);
						if (n < Integer.parseInt(strN) && Integer.parseInt(strN) <= large && (String.valueOf(n)).substring(3, 4) != "0"){
							possibs++;
						}
						String strNN = (String.valueOf(n)).substring(2, 4) + (String.valueOf(n)).substring(0, 2);
						if (n < Integer.parseInt(strNN) && Integer.parseInt(strNN) <= large && (String.valueOf(n)).substring(2, 3) != "0"){
							possibs++;
						}
						String strNNN = (String.valueOf(n)).substring(1, 4) + (String.valueOf(n)).substring(0, 1);
						if (n < Integer.parseInt(strNNN) && Integer.parseInt(strNNN) <= large && (String.valueOf(n)).substring(1, 2) != "0"){
							possibs++;
						}
					}
				}
				System.out.println(possibs);
				caseCounter++;
				out.write("Case #" + caseCounter + ": " + possibs);
				out.newLine();
			}
			in.close();
			out.close();
		}catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}
}
