/*
 * 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.IOException;
import java.io.PrintWriter;
import java.io.RandomAccessFile;
import java.util.Hashtable;

public class codejamb {

	/**
	 * @param args
	 * @throws IOException
	 * @throws NumberFormatException
	 */
	public static void main(String[] args) throws Exception {
		RandomAccessFile r = new RandomAccessFile("testcase.txt", "r");
		PrintWriter p = new PrintWriter("out.txt");
		int t = Integer.parseInt(r.readLine());
		for (int i = 1; i <= t; i++) {
			String[] line = (r.readLine()).split(" ");
			int a = Integer.parseInt(line[0]);
			int b = Integer.parseInt(line[1]);
			int count = countIt(a, b);
			p.println("Case #" + i + ": " + count);
		}
		p.close();

	}

	static int countIt(int a, int b) {
		int count = 0;
		for (int i = a; i <= b; i++) {
			for (int j = i + 1; j <= b; j++) {
				if (checkPair(i + "", j + "")) {
					count++;
				}
			}
		}
		return count;
	}

	static boolean checkPair(String x, String y) {
		if (x.length() == y.length() && isTheSame(x, y)) {
			for (int i = x.length() - 1; i >= 0; i--) {
				String sub = x.substring(i);
				// String sub2 = y.substring(0, sub.length());
				String newStr = sub + x.substring(0, i);
				if (newStr.equalsIgnoreCase(y))
					return true;
			}
			return false;
		} else {
			return false;
		}
	}

	static boolean isTheSame(String x, String y) {
		char[] xArr = x.toCharArray();
		char[] yArr = y.toCharArray();
		for (int i = 0; i < xArr.length; i++) {
			for (int j = 0; j < yArr.length; j++) {
				if (xArr[i] == yArr[j]) {
					xArr[i] = 0;
					yArr[j] = 0;
					break;
				}
			}
		}
		for (int i = 0; i < yArr.length; i++) {
			if (yArr[i] != 0 || xArr[i] != 0)
				return false;
		}
		return true;
	}

}
