package qual;

import java.util.Scanner;

public class RecycledNumbers {

	public static void main(String[] args) {
		new RecycledNumbers().run();

	}

	private void run() {
		Scanner sc = new Scanner(System.in);
		int T = sc.nextInt();
		for (int t = 0; t < T; t++) {
			int A = sc.nextInt();
			int B = sc.nextInt();
			int result = solve(A, B);
			System.out.printf("Case #%d: %d\n", t + 1, result);
		}
	}

	public int solve(int A, int B) {
		int result = 0;
		for (int i = A; i <= B; i++) {
			int dig = (int) Math.log10(A/*same as B*/) + 1;
			int aa = i;
			for (int d = 0; d < dig - 1; d++) {
				aa = (aa % 10) * (int)Math.pow(10, dig - 1) + (aa / 10);
				if (i == aa) {
					break;
				}
				if (i < aa && aa <= B) {
//					System.out.printf("(%d, %d) ", i, aa);
					result++;
				}
			}
		}
		return result;
	}

}

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