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.File;
import java.io.FileNotFoundException;
import java.util.Scanner;


public class Problem3_C {

	public static void main(String[] args) throws FileNotFoundException {

		Scanner scanner = new Scanner(new File("C-small-attempt0.in"));
		int num = scanner.nextInt();
		for(int count = 1 ; count <= num ; count++){
//			Set<String> set = new HashSet<String>();
//			Set<String> alreadyDone = new HashSet<String>();
			int ii = scanner.nextInt();
			int jj = scanner.nextInt();
			int counter = 0;
			for(int i = ii; i <= jj ; i++) {
				for(int j = i ; j <= jj ; j++) {
					String s1 = ""+i ;
					String s2 = ""+j ;
					for(int k = 0 ; k <= s2.length() ; k++) {
						if(i != j){
							String a = s2.substring(0, k);
							String b = s2.substring(k, s2.length());
							if((b+a).equals(s1) /*&& !alreadyDone.contains(alreadyDone.add(s1+"_"+s2))
									&& !alreadyDone.contains(alreadyDone.add(s2+"_"+s1))*/) {
								counter++;
//								alreadyDone.add(s1+"_"+s2);
//								alreadyDone.add(s2+"_"+s1);
//								System.out.println(s1 + "  --  "+ s2+ "  --  "  + (b+a));
							}
						}
					}				
				}
			}
			System.out.println("Case #"+count+": "+counter);
		}


	}

}
