import java.io.FileInputStream;
import java.util.HashMap;
import java.util.Scanner;
import java.util.TreeSet;

// Recycled Numbers
// https://code.google.com/codejam/contest/1460488/dashboard#s=p2

public class C {

	private static String process(Scanner in) {
		int A = in.nextInt();
		int B = in.nextInt();
		int res = 0;
		int len = Integer.toString(A).length();
		for(int n = A; n < B; n++) {
			String str = Integer.toString(n);
			TreeSet<Integer> set = new TreeSet<Integer>();
			for(int i = 1; i < len; i++) {
				int m = Integer.parseInt(str.substring(i, len) + str.substring(0, i));
				if ( m > n && m <= B && ! set.contains(m) ) {
					set.add(m);
					res++;
				}
			}
		}
		return Integer.toString(res);
	}

	public static void main(String[] args) throws Exception {
		Scanner in = new Scanner(System.in.available() > 0 ? System.in : 
			new FileInputStream(Thread.currentThread().getStackTrace()[1].getClassName() + ".practice.in"));
		int T = in.nextInt();
		for(int i = 1; i <= T; i++) 
			System.out.format("Case #%d: %s\n", i, process(in));
	}
}

import java.io.*;
class RecycledNumbers
{
  void main()throws IOException
  {
      BufferedReader obj= new BufferedReader(new FileReader("C-small-attempt0.in"));
      PrintWriter p= new PrintWriter(new BufferedWriter(new FileWriter("output.txt")));
      
      int T=Integer.parseInt(obj.readLine());
      long a,b,n,m,q,order,i,count=0;String s;
      
      for(i=1;i<=T;i++)
      {
          s=obj.readLine();
          
          a=Integer.parseInt(s.substring(0,s.length()/2));
          b=Integer.parseInt(s.substring(s.length()/2+1,s.length()));
          order=s.length()/2;
          
          for(n=a;n<=b;n++)
          {
              for(q=1;q<order;q++)
              {
                  m=(long)(n%Math.pow(10,q)*Math.pow(10,order-q)+(n/Math.pow(10,q)));
                  if(m>n&&m<=b)
                   count++;
                }
         
            }
            
            p.println("Case #"+i+": "+count);
                count=0;
      }
      p.flush();
      p.close();
    }
}
