/*
 * 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 static java.util.Arrays.deepToString;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileReader;
import java.io.PrintWriter;
import java.util.ArrayList;

public class C {
	public BufferedReader in;
	public PrintWriter out;

	void debug(Object...os) 	{System.err.println(deepToString(os));}
	static void pl(Object s)	{System.out.println(s);}
	static void p(Object s)		{System.out.print(s);}

	private int solve(int A, int B) {
		int count = 0;
		StringBuilder nn,mm;
		int n,m,c;
		for(n = A; n < B; ++n)	{
			nn = new StringBuilder();
			nn.append(n);
			for(m = n+1; m <= B; ++m)	{
				mm = new StringBuilder();
				mm.append(m);
				if (mm.length() > nn.length())	{m = B+1;	break;}	//number of digits dont match
				int l = mm.length();
				for(c = 0; c < l-1; ++c)	{
					mm.append(mm.charAt(0)).deleteCharAt(0);	//rotate by 1 char
					if (mm.toString().equals(nn.toString()))	{
//						pl("\tMATCH "+n+" : "+m);
						++count;
						break;
					}
				}
			}
		}
		return count;
	}

	public void run() throws Exception	{
		int T,A,B,v;
		String line;String[] tok;

		in = new BufferedReader(new FileReader(new File("C-small-attempt0.in")));
		out = new PrintWriter(new File("C-small-attempt0.out"));
//		in = new BufferedReader(new FileReader(new File("C-large.in")));
//		out = new PrintWriter(new File("C-large.out"));

		T = new Integer(in.readLine());
		for(int t=1;t<=T;++t)	{
			line = in.readLine();
			tok = line.split(" ");
			A = new Integer(tok[0]);
			B = new Integer(tok[1]);
			v = solve(A,B);
			System.out.println("Case #" + t + ": " + v);
			out.println("Case #" + t + ": " + v);
		}
		in.close();out.close();		
	}

	public static void main(String[] args) {
		try {
			java.util.Date t1 = new java.util.Date();
			new C().run();
			java.util.Date t2 = new java.util.Date();
			long diff = (t2.getTime() - t1.getTime());
			System.out.println("Time: "+(((float)diff)/1000));
		} catch (Exception e) {
			e.printStackTrace();
		}
	}
}
