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


import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.util.Scanner;
import java.util.logging.Level;
import java.util.logging.Logger;


public class QC {
    public static void main(String[] args) {
        try{
            Scanner sc = new Scanner(new File("C-small-attempt0.in"));    
            BufferedWriter bw = new BufferedWriter(new FileWriter(new File("output.out"))); 
            int t = sc.nextInt();
            for(int i=0;i<t;i++){
                int a = sc.nextInt();              
                int b = sc.nextInt();
                int r = 0;
                if(a>=100 && a<1000){
                    for(int p=1;p<10;p++){
                        for(int q=0;q<10;q++){
                            if(p==q)continue;
                            int e = 0,m = 0;
                            m = 100*q+10*p+p; if(m>=a && m<=b) e++;
                            m = 100*p+10*q+p; if(m>=a && m<=b) e++;
                            m = 100*p+10*p+q; if(m>=a && m<=b) e++;
                            if(e==3) r += 3;
                            else if(e==2) r += 1;
                        }
                    }
                    for(int p=0;p<10;p++){
                        for(int q=p+1;q<10;q++){
                            for(int s=q+1;s<10;s++){
                                int e = 0,m = 0;
                                m = 100*p+10*q+s; if(m>=a && m<=b) e++;
                                m = 100*q+10*s+p; if(m>=a && m<=b) e++;
                                m = 100*s+10*p+q; if(m>=a && m<=b) e++;
                                if(e==3) r += 3;
                                else if(e==2) r += 1;
                                
                                e = 0;
                                m = 100*p+10*s+q; if(m>=a && m<=b) e++;
                                m = 100*s+10*q+p; if(m>=a && m<=b) e++;
                                m = 100*q+10*p+s; if(m>=a && m<=b) e++;
                                if(e==3) r += 3;
                                else if(e==2) r += 1;
                            }
                        }
                    }
                }
                else if(a>=10){
                    for(int p=1;p<10;p++){
                        for(int q=p+1;q<10;q++){
                            if(p*10+q>=a && p*10+q<=b && q*10+p>=a && q*10+p<=b) r++;
                        }
                    }
                }
                bw.write("Case #"+String.valueOf(i+1)+": ");
                bw.write(String.valueOf(r));
                bw.newLine();
                bw.flush();
            }
            bw.close();

        } catch (Exception ex) {
            Logger.getLogger(QA.class.getName()).log(Level.SEVERE, null, ex);
        }
    }
}
