/*
 * 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.FileReader;
import java.util.ArrayList;

public class Run3
{
	private static class Pair
	{
		private String n;
		private String m;
		
		public Pair(String n, String m)
		{
			this.n = n;
			this.m = m;
		}
		
		public String getStringN()
		{
			return n;
		}
		
		public String getStringM()
		{
			return m;
		}
		
		public int getIntegerN()
		{
			return Integer.parseInt(n);
		}
		
		public int getIntegerM()
		{
			return Integer.parseInt(m);
		}
		
		@Override
		public boolean equals(Object obj)
		{
			Pair pair = (Pair)obj;
			if ((pair.getStringN().equals(this.n) && pair.getStringM().equals(this.m)) ||
				(pair.getStringN().equals(this.m) && pair.getStringM().equals(this.n)))
			{
				return true;
			}
			else
			{
				return false;
			}
		}
		
		@Override
		public String toString()
		{
			return n+" "+m;
		}
	}
	public static void main(String[] args)
	{
		String path = "files/C-small-attempt1.in";
		
		int T = 0;
		ArrayList<Integer> A = new ArrayList<Integer>();
		ArrayList<Integer> B = new ArrayList<Integer>();
		
		ArrayList<Pair> pairs = new ArrayList<Pair>();
		try
		{
			boolean isFirstLine = true;
			
			FileReader FR = new FileReader(path);
			BufferedReader BR = new BufferedReader(FR);
			String str = "";
			
			while((str=BR.readLine())!=null)
			{
				if (isFirstLine)
				{
					T = Integer.parseInt(str);
					isFirstLine = false;
				}
				else
				{
					String[] temp = str.split(" ");
					
					A.add(Integer.parseInt(temp[0]));
					B.add(Integer.parseInt(temp[1]));
				}
			}
		}
		catch (Exception e)
		{
			e.printStackTrace();
		}
		
		for (int i = 0; i < T; i++)
		{
			pairs.clear();
			int start = A.get(i);
			int end = B.get(i);
			
			for (int j = start; j <= end; j++)
			{
				String n = String.valueOf(j);
				String m = "";
				for (int x = 1; x < n.length() ; x++)
				{
					m = moveDigital(n, x);
					if (start <= Integer.parseInt(n) && Integer.parseInt(n) < Integer.parseInt(m) && Integer.parseInt(m) <= end)
					{
						Pair pair = new Pair(n, m);
						if (!pairs.contains(pair))
						{
							pairs.add(pair);
						}
					}
				}
			}
			System.out.println("Case #"+(i+1)+": "+pairs.size());
		}
	}
	
	static public String moveDigital(String number, int digitals)
	{
		return number.substring(number.length()-digitals, number.length())+number.substring(0, number.length()-digitals);
	}
}