import java.io.File;
import java.io.FileNotFoundException;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.HashMap;
import java.util.Map;
import java.util.Scanner;
import java.util.Set;

public class CopyOfCopyOfMain {

	static int ndigits(int n) {
		return (int) (Math.log10(n) + 1);
	}

	static int rot(int n, int dig) {
		return (int) ((n % 10) * Math.pow(10, dig - 1)) + (int) (n / 10);
	}

	public static void main(String[] args) throws FileNotFoundException {
		String file = "C-large";
		Scanner in = new Scanner(new File(file + ".in"));
		PrintWriter out = new PrintWriter(new File(file + ".out"));

		int T = in.nextInt();
		for (int t = 1; t <= T; t++) {
			int A = in.nextInt();
			int B = in.nextInt();

			int c = 0;
			int[] list = new int[ndigits(B)];
			numbers: for (int i = A; i <= B; i++) {
				int digs = ndigits(i);
				int rot = i;
				int pairs = 0;

				Arrays.fill(list, -1);
				list[0] = i;

				digits: for (int j = 1; j <= digs + 1; j++) {

					rot = rot(rot, digs);
					if(rot < i)
						continue;

					if (A <= rot && rot <= B) {
						for (int k = 0; k < j; k++) {
							if (list[k] == rot) {
								continue digits;
							}
						}
						pairs++;
						list[j] = rot;
					}
				}

				//c += pairs * (pairs + 1) / 2;
				c += pairs ;
				// c+=digs;
			}
			out.println("Case #" + t + ": " + c);
		}

		in.close();
		out.close();
	}
}

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


import java.io.FileReader;
import java.io.FileWriter;
import java.io.IOException;
import java.io.PrintWriter;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;
/**
 *
 * @author abdallah gaber
 */
public class RecycledNumbers {
      ///////////////////////////variables////////////////
   

    public static void main(String[] args)
    {   
        int res= 0 ,A,B,counter,number;
        String sA,sB,temp;
        int[] array = new int[7];
        int cntarray=0;
        boolean flag = true;
        PrintWriter pw = null;
        Scanner sc = null;
        try {
                sc = new Scanner(new FileReader("C:\\Users\\abdallah gaber\\Documents\\NetBeansProjects\\CodeJam2012\\src\\Qualification\\Clargeinput.in"));
                pw = new PrintWriter(new FileWriter("C:\\Users\\abdallah gaber\\Documents\\NetBeansProjects\\CodeJam2012\\src\\Qualification\\Clargeoutput.out"));
                int casCnt=Integer.parseInt(sc.nextLine());
                for(int cnt=0;cnt<casCnt;cnt++)
                {
                    A=sc.nextInt();
                    B=sc.nextInt();
                    //System.out.println(A+"  "+B);
                    sB=String.valueOf(B);
                    //System.out.println(sB.substring(1));
                    for(int j=A;j<=B;j++)
                    {
                        sA=String.valueOf(j);
                        counter=sA.length();
                        int count=counter;
                        array[cntarray]=j;
                        cntarray++;
                        temp=sA;
                        while(count>1)
                        {
                            //System.out.println(sA.substring(((counter-count)+1), (counter))+" "+sA.substring((counter-count)));
                            temp =  temp.substring(1,counter) + temp.charAt(0);
                            number = Integer.parseInt(temp);
                            for (int t=0;t<cntarray;t++)
                                if(number==array[t])
                                {
                                    flag=false;
                                    break;
                                }
                            if(flag==true)
                            {
                                array[cntarray]=number;
                                cntarray++;
                            }
                            //System.out.println("aa"+j+" "+number);
                            if(number<=B&&number>=A&&j<number&&flag)
                            {
                               // System.out.println(j+" "+number);
                                res++;
                            }
                            count--;
                            flag=true;
                        }
                        cntarray=0;
                        flag=true;
                    }
                    pw.println("Case #"+(cnt+1)+": "+res);
                    res=0;
                    cntarray=0;
                }
        } catch (IOException ex) {
            Logger.getLogger(Speaking_in_Tongues.class.getName()).log(Level.SEVERE, null, ex);
        } finally {
            pw.flush();
            pw.close();
            sc.close();
        }
    }
    
}
