/*
 * 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.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.util.ArrayList;
import java.util.List;

public class Main {

	public static void main(String[] args) throws NumberFormatException,
			IOException {
		new Main().go(args);
	}

	void go(String[] args) throws NumberFormatException, IOException {
		short n;// no of test cases
		BufferedReader bufferedReader = new BufferedReader(
				new InputStreamReader(new FileInputStream(new File(args[0]))));
		BufferedWriter bufferedWriter = new BufferedWriter(
				new OutputStreamWriter(new FileOutputStream(new File(args[1]))));
		n = Short.parseShort(bufferedReader.readLine());
		for (short i = 0; i < n; i++) {
			String input = bufferedReader.readLine();
			StringBuffer output = new StringBuffer();
			// Main logic is here
			perform(input, output);
			bufferedWriter.write("Case #" + (i + 1) + ": " + output.toString()
					+ "\n");
			bufferedWriter.flush();
		}
		bufferedReader.close();
		bufferedWriter.close();
	}

	private void perform(String input, StringBuffer output) {
		// TODO Auto-generated method stub
		String[] split = input.split(" ");
		int A = Integer.parseInt(split[0]);
		int B = Integer.parseInt(split[1]);
		if (A < 10 || B < 10) {
			output.append(0);
			return;
		}
		List<Pair> recycledPairs = new ArrayList<Pair>();
		for (int i = A; i <= B; i++) {
			String n = new Integer(i).toString();
			for (int j = 1; j < n.length(); j++) {
				String m = rotate(n, j);
				if (!n.equals(m) && !m.startsWith("0")
						&& Integer.parseInt(m) >= A && Integer.parseInt(m) <= B) {
					Pair pair = new Pair(n, m);
					if (!recycledPairs.contains(pair))
						recycledPairs.add(pair);
				}
			}
		}
		output.append(recycledPairs.size());
	}

	private String rotate(String n, int i) {
		// TODO Auto-generated method stub
		StringBuffer buffer = new StringBuffer();
		int iterations = 0;
		while (iterations < n.length()) {
			buffer.append(n.charAt(i));
			i = (i + 1) % n.length();
			iterations++;
		}
		return buffer.toString();
	}

	class Pair {
		String n;
		String m;

		public Pair(String n, String m) {
			// TODO Auto-generated constructor stub
			this.n = n;
			this.m = m;
		}

		@Override
		public boolean equals(Object obj) {
			// TODO Auto-generated method stub
			if (obj instanceof Pair) {
				Pair temp = (Pair) obj;
				if ((temp.n.equals(this.n) && temp.m.equals(this.m))
						|| (temp.n.equals(this.m) && temp.m.equals(this.n))) {
					return true;
				}
			}
			return false;
		}

		@Override
		public String toString() {
			// TODO Auto-generated method stub
			return n + "," + m;
		}
	}
}

