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

public class Pilot {

	int Globe_k = 0;
	int max_units = 30;

	public static void main(String[] args) {
		Pilot my = new Pilot();

		Calendar cal1 = Calendar.getInstance();
		my.doAll();
		Calendar cal2 = Calendar.getInstance();
		// System.out.println("seconds : " + (cal2.getTimeInMillis() -
		// cal1.getTimeInMillis())/1000);
	}
	private static void doME(Vector<Integer> combination) {
		System.out.println(combination.toString());
	}
	public void doAll() {
		try {

			String out = "";

			FileInputStream fstream = new FileInputStream("in.txt");
			DataInputStream in = new DataInputStream(fstream);
			BufferedReader br = new BufferedReader(new InputStreamReader(in));
			String strLine = "";

			int glob = Integer.parseInt(strLine = br.readLine());

			for (int j = 0; j < glob; j++) {

				
				
				
				Vector<Vector<Integer>> results = new Vector<Vector<Integer>>();
				
				strLine = br.readLine();
				String[] splitted = strLine.split(" ");
				int A = Integer.parseInt(splitted[0]);
				int B = Integer.parseInt(splitted[1]);

				int num = 0;

				for (int k = A; k <= B; k++) {
					int L = Integer.toString(k).length();
					int e = L - 1;
					int C = k;
					Integer[][] T = new Integer[L][2];

					for (int i = 0; i < L; i++) {
						T[i][0] = (C % 10);
						C /= 10;
						T[i][1] = i;
					}

					for (int i = 0; i < e; i++) {
						for (int q = 0; q < L; q++) {
							T[q][1] = (q + e - i) % L;
						}

						// for (int u = 0; u < L; u++)
						// System.out.println(T[u][0] + " " + T[u][1]);

						int n = k;
						int m = 0;
						for (int q = 0; q < L; q++)
							m += T[q][0] * (int) Math.pow(10, T[q][1]);

						if (A <= n && n < m && m <= B) {
							Vector<Integer> combination = new Vector<Integer>();;
							combination.addElement(n);
							combination.addElement(m);
							if (!results.contains(combination)) {
								//doME(combination);
								results.addElement(combination);
								//System.out.println(k + " - " + m);
								num++;
							}
							
						}
						// System.out.println("---");
					}
					
					
					
					
					
					
					
					
				}
				out += ("Case #" + (j + 1) + ": " + num + "\n");
			}
			in.close();
			out = out.trim();

			Writer output = null;
			File file = new File("out.out");
			output = new BufferedWriter(new FileWriter(file));
			output.write(out);
			output.close();

			System.out.print(out);

		} catch (Exception e) {
			System.err.println("Error: " + e.getMessage());
			
			
		}
	}
}
