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



//Author KNIGHT0X300 

import java.util.Scanner;
import java.util.TreeSet;




public class Main {
    
    public static void main(String[] args) {
       Scanner s=new Scanner(System.in);
     TreeSet<Integer> ts=new TreeSet<Integer>();
       int[] A1=new int[8];
      A1[0]=1; A1[1]=10; A1[2]=100; A1[3]=1000; A1[4]=10000; A1[5]=100000; A1[6]=1000000; A1[7]=10000000;
       int t=s.nextInt();
     long time = System.nanoTime();  
       for(int i=0;i<t;i++)
       {  int tot=0;
           int A=s.nextInt();
           int B=s.nextInt();
               for(int j=B;j>A;j--)
         {  int y=j ;
         ts.clear();
            int sz= (int)Math.floor(Math.log10(j));
             
         for(int k=1;k<sz+1;k++)
         {  
             int p=j%(int)A1[k];
             y= (int) (Math.floor(j/A1[k])+p*(int)A1[sz+1-k]);
          
         
             if((y<j)&&(y>=A)){
                 if(!ts.contains(y))
                  tot++;ts.add(y);}
        
             }
         
         }
         
         
         
         
           
           
           
           
           
           
        System.out.println("Case #"+(i+1)+": "+tot);
                      
          
       }
       
 System.out.println("Finished in: " + (System.nanoTime() - time) / Math.pow(10, 6) + "ms");
    }
}
