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

class RecycledNumbers {
    public static void main(String[] args)
        throws Exception {
        new RecycledNumbers().start();
    }

    void start()
        throws Exception {
        InputStreamReader is =
            new InputStreamReader(
                                  new FileInputStream("Input"));
        BufferedReader br = new BufferedReader(is);
        OutputStreamWriter os =
            new OutputStreamWriter(
                                   new FileOutputStream("Output"));
        BufferedWriter bw = new BufferedWriter(os);
        String line;
	int[] inputs;
        int test = 1;
        line = br.readLine();
        while ((line = br.readLine()) != null) {
	    String[] inp = line.split(" ");
            inputs = new int[inp.length];
            int i = 0;
            for (String s :  inp) {
                inputs[i++] = Integer.parseInt(s);
            }
	    System.out.print("Case #" + test + ": ");
            String toWrite = "Case #" + test++ + ": ";
            bw.write(toWrite, 0, toWrite.length());

	    int len = inp[0].length();
	    int first = Integer.parseInt(inp[0]);
	    int second = Integer.parseInt(inp[1]);
	    int result = 0;
    
	    for (int j = first; j < second; j++) {
		String str = Integer.toString(j);
		str += str;
		//System.out.println(str);
		//System.out.println(len);
		ArrayList<Integer> arr = new ArrayList<Integer>();
		for (int k = 1; k < len; k++) {
		    int x = Integer.parseInt(str.
					     substring(k, k+len));
		    
		    if (x <= second && x > j) {
			if (!arr.contains(new Integer(x))) {
			    arr.add(new Integer(x));
			    result++;
			}
			//System.out.println(j + " " + x);
		    }
		    //System.out.print(x + " ");
		}
	    }
	    System.out.println(result);
	    String res = Integer.toString(result);
            bw.write(res, 0, res.length());

	    bw.newLine();
	}
	br.close();
	bw.close();
    }
}