import java.util.Scanner;

class Main {
	public static void main(String[] args) {
		Scanner sc = new Scanner(System.in);
		int t=sc.nextInt();
		int casos=1, a, b, n, m, cont;
		while(t!=0){
			a=sc.nextInt();
			b=sc.nextInt();
			if(a>b){
				int aux=a;
				a=b;
				b=aux;
			}
			System.out.printf("Case #%d: ",casos++);
			if(a==b){
				System.out.printf("%d\n",0);
			}else{
				cont=0;
				for(n=a;n<b;n++){					
					for(m=n+1;m<=b;m++){					
						if(isRecycled(n,m)) cont++;
					}
				}
				System.out.printf("%d\n",cont);
			}
			t--;
		}		
	}
	public static boolean isRecycled(int n1, int n2){
		String s1, s2, aux;
		s1 =  String.valueOf( n1 );
		s2 =  String.valueOf( n2 );		
		boolean r = false;		
		for(int i=0;i<s1.length();i++){
			aux="";
			aux=s1.substring(i,s1.length())+s1.substring(0,i);
//			System.out.println(aux);
			if(aux.equals(s2)){
				r=true;
				break;
			}
		}		
		return r;
	}
}

import java.io.*;
import java.util.*;
public class Main{
    public static void main (String[] args) throws java.lang.Exception{
      Scanner in = new Scanner(System.in);
      int T=in.nextInt();
      int res[]=new int[T];

      for(int t=0;t<T;t++){
          int A=in.nextInt();
          int B=in.nextInt();
          for(int i=A;i<=B;i++){
              HashSet<Integer> hs=new HashSet<Integer>();
              String tt=i+"";
              int lenT=tt.length();
              int len=lenT-1;
              int temp=i;
              while(len>0){
                  len--;
                  int rem=temp%10;
                  temp=temp/10;
                  if(rem!=0)
                    temp=rem*(int)Math.pow(10,lenT-1)+temp;
                  if(temp<=B && temp>i){  
                        hs.add(temp);
                  }
              }
              res[t]+=hs.size();
          }
      }
      for(int i=0;i<T;i++){
          System.out.println("Case #"+(i+1)+": "+res[i]);
      }

     
    }
}