package jp.funnything.competition.util;

import java.math.BigInteger;

/**
 * Utility for BigInteger
 */
public class BI {
    public static BigInteger ZERO = BigInteger.ZERO;
    public static BigInteger ONE = BigInteger.ONE;

    public static BigInteger add( final BigInteger x , final BigInteger y ) {
        return x.add( y );
    }

    public static BigInteger add( final BigInteger x , final long y ) {
        return add( x , v( y ) );
    }

    public static BigInteger add( final long x , final BigInteger y ) {
        return add( v( x ) , y );
    }

    public static int cmp( final BigInteger x , final BigInteger y ) {
        return x.compareTo( y );
    }

    public static int cmp( final BigInteger x , final long y ) {
        return cmp( x , v( y ) );
    }

    public static int cmp( final long x , final BigInteger y ) {
        return cmp( v( x ) , y );
    }

    public static BigInteger div( final BigInteger x , final BigInteger y ) {
        return x.divide( y );
    }

    public static BigInteger div( final BigInteger x , final long y ) {
        return div( x , v( y ) );
    }

    public static BigInteger div( final long x , final BigInteger y ) {
        return div( v( x ) , y );
    }

    public static BigInteger mod( final BigInteger x , final BigInteger y ) {
        return x.mod( y );
    }

    public static BigInteger mod( final BigInteger x , final long y ) {
        return mod( x , v( y ) );
    }

    public static BigInteger mod( final long x , final BigInteger y ) {
        return mod( v( x ) , y );
    }

    public static BigInteger mul( final BigInteger x , final BigInteger y ) {
        return x.multiply( y );
    }

    public static BigInteger mul( final BigInteger x , final long y ) {
        return mul( x , v( y ) );
    }

    public static BigInteger mul( final long x , final BigInteger y ) {
        return mul( v( x ) , y );
    }

    public static BigInteger sub( final BigInteger x , final BigInteger y ) {
        return x.subtract( y );
    }

    public static BigInteger sub( final BigInteger x , final long y ) {
        return sub( x , v( y ) );
    }

    public static BigInteger sub( final long x , final BigInteger y ) {
        return sub( v( x ) , y );
    }

    public static BigInteger v( final long value ) {
        return BigInteger.valueOf( value );
    }
}

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

import java.io.*;
import java.util.logging.Level;
import java.util.logging.Logger;
import java.util.*;
/**
 *
 * @author usuario
 */
public class CodejamC {

    /**
     * @param args the command line arguments
     */
    public static int fun(int a,int b,int i){
      int cont=0,n=0,mod,res=i;
      boolean flag;
      String num=i+"";
      String aux;
      int tmp;
      tmp=num.length();
      while(n<tmp-1){
        flag=false;  
        n++;
        if(res<Math.pow(10,tmp-1))
         flag=true;
        mod=res%10;
        num=""+res;
        if(flag){
             num="0"+res;
        }    
        aux=""+mod;
        aux+=num.substring(0,num.length()-1);
        res=Integer.parseInt(aux);
        
        if(res>i && res<= b){
          cont++;
        }  
       }
      return cont;
    }
    public static void main(String[] args){ 
        int n,a,b,cont=0;
        try {
            System.setIn(new FileInputStream("file.in"));
        } catch (FileNotFoundException ex) {
            Logger.getLogger(CodejamC.class.getName()).log(Level.SEVERE, null, ex);
        }
        Scanner reader=new Scanner(System.in);
        n=reader.nextInt(); 
        for(int i=0;i<n;i++){
          cont=0;  
          a=reader.nextInt();
          b=reader.nextInt();
          for(int j=a;j<=b;j++){
            cont+=fun(a,b,j);  
          }
          System.out.println("Case #"+(i+1)+": "+ cont);
        }
      
    }
}
