/*
 * 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.lang.Math;
import java.util.Arrays;

public class RecycledNumbers {

	public static int testSize = 0;
	
	public static int[] convertString2Nums(int n, String str) {
		int[] result = new int[n];
		
		int begIndex = 0;
		int endIndex = 0;
		
		for(int i = 0; i < n - 1; i++) {
			endIndex = str.indexOf(' ', begIndex);
			result[i] = Integer.parseInt(str.substring(begIndex, endIndex));
			begIndex = endIndex + 1;
		}
		result[n - 1] = Integer.parseInt(str.substring(begIndex, str.length()));
		return result;
	}
	
	public static boolean isExist(String[] a, String b, int length) {
		for(int i = 0; i < length; i++) {
			if(b.equalsIgnoreCase(a[i])) {
				return true;
			}
		}
		return false;
	}
	
	public static int numOfRecycleNumbers(int A, int B) {
		int result = 0;
		String str = new String();
		int length = (new Integer(A)).toString().length();
		String[] recycleStr = new String[length - 1];
		int uniqueRecStr = 0;
		int pair = 0;
		for(int i = A; i <= B; i++) {
			str = new String((new Integer(i)).toString() + (new Integer(i)).toString());
			recycleStr = new String[length - 1];
			uniqueRecStr = 0;
			for(int j = 1; j < length; j++) {
				String substr = new String(str.substring(j, j + length));
				if(false == isExist(recycleStr, substr, uniqueRecStr)) {
					recycleStr[uniqueRecStr] = substr;
					uniqueRecStr++;
				}
			}
			for(int j = 0; j < uniqueRecStr; j++) {
				pair = Integer.parseInt(recycleStr[j]);
				if(pair > i && pair <= B) {
					//System.out.println("pair " + (result+1) + ": " + i + " " + pair);
					result ++;
				}
			}
		}
		return result;
	}
	public static void Output(String inPath, String outPath) {
		try {
			FileInputStream fstream = new FileInputStream(inPath);
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			File of = new File(outPath);
			of.delete();
			BufferedWriter bw = new BufferedWriter(new FileWriter(new File(outPath), true));
			
			String line = br.readLine();
			
			int[] parameters = convertString2Nums(1, line);
			int numOfTest = parameters[0];
			
			String str = new String();
			for(int i = 0; i < numOfTest; i ++) {
				line = br.readLine();
				parameters = convertString2Nums(2, line);
				str = new String("Case #" + (i+1) + ": " + numOfRecycleNumbers(parameters[0], parameters[1]));
				System.out.println(str);
				bw.write(str);
				bw.newLine();
			}	 
			
			in.close();
			bw.close();
		} catch (Exception e){//Catch exception if any
			System.err.println("Error: " + e.getMessage());
		}
	}
	
	//public static 
	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		String inFile  = new String();
		String outFile = new String();
		testSize = 1;
		switch(testSize) {
			case 0:
				inFile = new String("./C-test.in");
				outFile = new String("./C-test.out");
				break;
				
			case 1:
				inFile = new String("./C-small-attempt0.in");
				outFile = new String("./C-small-attempt0.out");
				break;
				
			case 2:
				inFile = new String("./A-large-practice.in");
				outFile = new String("./A-large-practice.out");
				break;
			default:
				break;
		}		
		Output(inFile, outFile);
	}


}
