/*
 * 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 recycled
{

	public static void main(String[] args)
	{
		try
		{
			FileReader fread = new FileReader(new File("C-small-attempt0.in"));
			BufferedReader br = new BufferedReader(fread);
			FileWriter fwrite = new FileWriter(new File("output.txt"));
			PrintWriter pw = new PrintWriter(fwrite);
			int cases = new Integer(br.readLine());
			for (int i = 1; i <= cases; i++)
			{
				String line = br.readLine();
				StringTokenizer st = new StringTokenizer(line);
				String temp = st.nextToken();
				if (temp.length() == 1)
				{
					pw.println("Case #" + i + ": 0");
					System.out.println("Case #" + i + ": 0");
				}
				else
				{
					int min = new Integer(temp);
					int max = new Integer(st.nextToken());

					int count = 0;

					for (int j = min; j <= max; j++)
					{
						String current = "" + j;
						String changing = current;
						HashSet<Integer> seen = new HashSet<Integer>();
						for (int k = current.length() - 1; k > 0; k--)
						{
							changing = changing.substring(1) + changing.charAt(0);
							int intchanging = new Integer(changing);
							if ((intchanging > new Integer(current)) && (intchanging <= max) && (!seen.contains(intchanging)))
							{
								count++;
								seen.add(intchanging);
							}
						}
					}
					/*
					 * int end = max / 10; System.out.println(end);
					 * System.out.println(tens); for (int j = min; j <= max;
					 * j++) { int ref = j / 10; int mod = j % 10; boolean found
					 * = false; while (ref > 0) { int check = ref % 10; if
					 * (check != mod) { found = true; break; } ref /= 10; } if
					 * (found) { if (((j % tens) < end)&&((j % tens) >=
					 * (tens/10))) { if ((j / tens) < (j % tens)) {
					 * System.out.print(j +" "); count++; } } } }
					 */
					pw.println("Case #" + i + ": " + count);
					System.out.println("Case #" + i + ": " + count);
				}
			}
			pw.close();
		}
		catch (FileNotFoundException e)
		{
			e.printStackTrace();
		}
		catch (IOException e)
		{
			e.printStackTrace();
		}
	}

}
