/*
 * To change this template, choose Tools | Templates
 * and open the template in the editor.
 */
package recyclednumbers;

import java.util.HashSet;

/**
 *
 * @author vandit
 */
public class RecycleNumbers {

    private HashSet<String> numbers = new HashSet<String>();
    private HashSet<String> initialTempNumbers = new HashSet<String>();
    private HashSet<String> finalTempNumbers = new HashSet<String>();

    HashSet<Pair> numberPairs = new HashSet<Pair>();


    private void findRecycledNumbers(int start, int end, int places) {


        for (int i = start; i <= end; i++) {
            String initialNumber = Integer.toString(i);
            //if (!(numbers.contains(initialNumber) || finalTempNumbers.contains(initialNumber))) {

                StringBuffer tempNumber = new StringBuffer(initialNumber);
                int len = tempNumber.length();
                int startIndexToMove = len - places;
                String tempString = tempNumber.substring(startIndexToMove);
                if ((places == 1 && tempString.equals("0")) || tempString.charAt(0) == '0') {
                    continue;
                }
                tempNumber.delete(startIndexToMove, len);
                String finalTempNumber = tempString + tempNumber.toString();

                if (! (finalTempNumber.equals(initialNumber) || Integer.parseInt(finalTempNumber) > end || Integer.parseInt(finalTempNumber) < Integer.parseInt(initialNumber))) {
                    numbers.add(initialNumber);
                    finalTempNumbers.add(finalTempNumber);
                    Pair pair = new Pair(finalTempNumber,initialNumber);
                    numberPairs.add(pair);
                }
            }

        

    }

    public HashSet<Pair> findAllRecycledNumbers(int start, int end) {
        int length = Integer.toString(start).length();
        for (int i = 1; i < length; i++) {
            findRecycledNumbers(start, end, i);
        }
        return numberPairs;
    }
}

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();
		}
	}
}
