/*
 * 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.File;
import java.io.FileNotFoundException;
import java.io.FileWriter;
import java.io.IOException;
import java.util.ArrayList;
import java.util.HashSet;
import java.util.List;
import java.util.Scanner;
import java.util.Set;


public class RecycledNumbers {
	
	public static void main(String[] args) {

		Scanner sc = null;
		try {
			sc = new Scanner(new File("./C-small-attempt0.in"));
		} catch (FileNotFoundException e1) {
			// TODO Auto-generated catch block
			e1.printStackTrace();
		}
		int numTestCases = Integer.parseInt(sc.nextLine());
		String eachTest = "";
		StringBuilder result = new StringBuilder();
		
		for(int i = 0; i < numTestCases; ++i) {
			eachTest = sc.nextLine();
			result.append(String.format("Case #%s: ", i+1));
			result.append(compute(eachTest));
			result.append("\n");
		}
		
		try {
			FileWriter fileWriter = new FileWriter("./output");
			fileWriter.write(result.toString());
			fileWriter.close();
		} catch (IOException e) {
			// TODO Auto-generated catch block
			e.printStackTrace();
		}
	
		return;
	}
	
	private static int compute(String input) {
		String[] pieces = input.split(" ");
		int A = Integer.parseInt(pieces[0]);
		int B = Integer.parseInt(pieces[1]);
		return compute(A, B);
	}
	
	public static int compute(int A, int B) {
		Set<String> set = new HashSet<String>();
		int digitLen = ("" + A).length();
		int m = 0;
		for(int n = A; n <= B; ++n) {
			for(int i = 1; i < digitLen; ++i) {
				m = shift(n, i);
				if(m > n && m <= B) {
					set.add(n + "-" + m);
				}
			}
		}
		
		return set.size();
	}
	
	static int shift(int n, int i) {
		String word = "" + n;
		int len = word.length();
		int shift = len - i - 1;
		if(len < 2) {
			return n;
		} else if(len == 2) {
			String a = new String(word.charAt(1) + "");
			String b = new String(word.charAt(0) + "");
			return Integer.parseInt( a + b);
		}
		return Integer.parseInt(word.substring(shift + 1) + word.substring(0, shift + 1));
	}
	

	
}
