/*
 * 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();

    }

}

/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package cj2012;

/**
 *
 * @author aaron
 */
public class ACj2012 {

    public static void main(String[] args) {
    //System.out.println(recyclePairs("1111 2222"));
    	dataOut(processData(getData("C-small-attempt0.in")));
    }
    public static int dataOut(String data){
    	java.io.BufferedWriter dst;
    	 try{
            dst = new java.io.BufferedWriter( new java.io.FileWriter("cj.out"));
            dst.write(data);
            dst.close();
            System.out.println("");
        } catch (java.io.IOException e2) {
            System.out.println(e2.getMessage());
        }
    	return 0;
    }
    static boolean isDistinct(String str1, String str2,String strlong){
    	String[] pairs = strlong.split(";");
    		for (int i = 0 ; i < pairs.length; i++){
    		if (pairs[i].equals(str1 + "," + str2)){
    			return false;
    		}
    		else	if  (pairs[i].equals(str2 + "," + str1)){
    				return false;
    		}
    	}
    	return true;
    }
    static int recyclePairs(String data){
    	int num1 = Integer.valueOf(data.split(" ")[0]);
    	int num2 = Integer.valueOf(data.split(" ")[1]);
    	String distinct = "";
    	int c = 0;
    	if (num1 >= 10){
    		for (int i = num1; i <= num2; i++){
    			for (int j = num1; j <= num2 ; j++){
    				if (i!=j){
    					if (isPair(Integer.toString(i),Integer.toString(j))){
    						if (isDistinct(Integer.toString(i),Integer.toString(j),distinct)){
    							c++;
    							distinct += Integer.toString(i) + "," + Integer.toString(j) + ";" ;

    						}
    					}
    				}
    			}
    		}
    	}
    	return c;
    }
    static boolean isPair(String str1, String str2){
    	String strT = str2;
	    	for (int i = 0; i < str1.length() ; i++){
    			strT = strT.substring(strT.length() -1,strT.length())+strT.substring(0,strT.length()-1);
    			if (strT.substring(0,1).equals("0")){
    				return false;
    			} else if (str1.equals(strT)) {
    				return true;
    			}
    		}
    		return false;
    }
    public static String[] getData( String filename){
        java.io.BufferedReader src;
       	String str = "";
       	String[] in = new String[1];
       	int lines = 0;
        try{
            src = new java.io.BufferedReader(new java.io.FileReader(filename));
            str = src.readLine();
            lines = Integer.parseInt(str);
            in = new String[lines];
            for (int i = 0; i<lines; i++){
            	str = src.readLine();
            	in[i] = str;
            }
        } catch (java.io.IOException e2) {
           System.out.println(e2.getMessage());
        }
        return in;
    }
    static String processData(String[] data){
    	String str = "";
    	for(int i = 0; i < data.length;i++){
    		str += "Case #" + (i+1) + ": " + recyclePairs(data[i]) + "\n";
    	}
    	return str.substring(0,str.length() - 1);

    }
}
