/*
 * 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.lang.System.*;
import static java.lang.Math.*;
import static java.lang.Character.*;
import java.io.*;
import java.util.*;
public class recycled
{
    public static Scanner in;
    public static String nl(){return in.nextLine();}
    public static int ni(){return in.nextInt();}
    public static double nd(){return in.nextDouble();}
    public static int pi(String a){return Integer.parseInt(a);}
    public static double pd(String a){return Double.parseDouble(a);}
    public static void pl(Object o) { out.println(o); }
    public static void pl() { out.println(); }
    public static void pt(Object o) { out.print(o); }
    public static void plf(String f, Object... o) { out.printf(f, o); out.println(); }
    public static String nt(){return in.next();}
    public static void main(String[]args) throws IOException
    {
    	in=new Scanner(new File("recycled.dat"));
        in=new Scanner(new File("C-small-attempt2.in"));
    //    in=new Scanner(System.in);
	    int count  = ni();
	    for (int da = 1; da <= count; da++)
	    {
	    	int s = ni(), e = ni();
	    	//pl (s + ", " + e);
	        TreeSet<String> gused = new TreeSet<String>();
	        for (int xx = s; xx < e; xx++)
	        {
	        	String n = "" + xx;


        		ArrayList<Character> alt = new ArrayList<Character>();
        		for (char c : n.toCharArray())
        			alt.add(c);
	        	for (int i = 0; i < n.length(); i++)
	        	{
	        		Collections.rotate(alt, 1);

	        		String t = "";
	        		for (Character c : alt)
	        			t += "" + c;
	        		//pl(t);
	        		//pl(n);
	        		if (!gused.contains(t+"|"+n) && pi(n) >= s && pi(t) <= e && pi(n) < pi(t))
	        		{
	        			gused.add(t+"|"+n);

	        		}
	        	}

	        }
	        pl("Case #" + da + ": " + gused.size());
	    }
    }
}