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.FileWriter;
import java.io.IOException;
import java.util.Scanner;

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

/**
 *
 * @author utp
 */
public class C {
    public static void main(String Args[]) throws IOException{
        Scanner sc = new Scanner (new File("input.in"));
        FileWriter fw = new FileWriter("output.out");
        int T = sc.nextInt();
        for (int k=0;k<T;k++){
            int A=sc.nextInt();
            int B = sc.nextInt();
            int count=0;
        for (int i=A;i<=B;i++){
            for (int j=i+1;j<=B;j++){
            String num1 = Integer.toString(i);
            String num2 = Integer.toString(j);
            if (j==1121){
              //  System.out.println("");
            }
             int c = calcular(num1.toCharArray(),num2.toCharArray());
             if (c>=0){
                 String sub2 = num2.substring(0, c);
                 String sub1 = num2.substring(c);
                 if (num1.equals(sub1.concat(sub2))){
                  //   System.out.println("Case #"+(k+1)+": "+sub1+" "+sub2+" "+num1+" "+num2);
                     count++;
                 }
             }
            }
            }
        fw.write("Case #"+(k+1)+": "+count+"\n");
        }
        fw.close();
    }
    
    public static int calcular(char cad1[], char cad2[]){
        for (int j=0;j<=cad1.length;j++){
            String temp1 = String.copyValueOf(cad1, j,cad1.length-j);
            String tmp2 = String.copyValueOf(cad2);
            if (tmp2.contains(temp1)){
                return temp1.length();
            }
            
        }
        return -1;
    }
}
