/*
 * 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.File;
import java.io.FileReader;
import java.io.PrintWriter;

public class RecycledNumbers {

	public RecycledNumbers() {
		solve();
	}

	/**
	 * Solves Problem A. Speaking in Tongues
	 */
	private void solve() {
		try {
			File f = new File("./C-small-attempt0.in.txt");
			File output = new File("./output2.out");

			if (output.exists())
				output.delete();

			output.createNewFile();

			PrintWriter pw = new PrintWriter(output);
			FileReader fr = new FileReader(f);
			BufferedReader br = new BufferedReader(fr);

			String linea = br.readLine();
			linea = br.readLine();

			int i = 1;
			while (linea != null) {
				int a = Integer.parseInt(linea.split(" ")[0]);
				int b = Integer.parseInt(linea.split(" ")[1]);

				pw.println("Case #" + i + ": " + getRecycledAmmount(a, b));
				linea = br.readLine();
				i++;
			}

			pw.close();
			br.close();
			fr.close();

		} catch (Exception e) {
			e.printStackTrace();
		}

	}

	private int getRecycledAmmount(int start, int end) {
		int ammount = 0;

		for (int n = start; n <= end; n++) {
			for (int m = start; m <= end; m++) {
				if (n < m && isRecycled("" + n, "" + m))
					ammount++;
			}
		}

		return ammount;
	}

	private boolean isRecycled(String n, String m) {

		for (int i = m.length()-1; i > 0; i--) {
			
			String prefix = m.substring(0, i);			
			String suffix = m.substring(i);
			
			String recycled = suffix + prefix;
			if(recycled.equals(n))
				return true;

		}

		return false;

	}

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		new RecycledNumbers();
	}

}
