#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 2007 ;

int test_id ;
pii lim[ 3 ] ;

ull dp[ 3 ][ MAXN ][ 11 ][ 2 ] ;
ull sm[ 3 ][ MAXN ][ 11 ][ 2 ] ;
ull ans ;

void proc ( int id ) {
    for ( int i = 0 ; i < MAXN ; ++ i ) {
        for ( int j = 0 ; j < 11 ; ++ j ) {
            for ( int t = 0 ; t < 2 ; ++ t ) {
                dp[ id ][ i ][ j ][ t ] = sm[ id ][ i ][ j ][ t ] = 0 ;
            }
        }
    }
    for ( int x = 0 ; x <= lim[ id ].fi ; ++ x ) {
        for ( int y = 0 ; y <= lim[ id ].se ; ++ y ) {
            int diff = abs ( x - y ) ;
            for ( int bit = 0 ; bit < 11 ; ++ bit ) {
                int cnt = 0 ;
                if ( ( x & ( 1 << bit ) ) > 0 ) { cnt ^= 1 ; }
                if ( ( y & ( 1 << bit ) ) > 0 ) { cnt ^= 1 ; }
                // if ( ( diff & ( 1 << bit ) ) > 0 ) { cnt ^= 1 ; }
                ++ dp[ id ][ diff ][ bit ][ cnt ] ;
            }
        }
    }
    // printf ( "here %d\n" , id ) ;
    for ( int diff = MAXN - 1 ; diff >= 0 ; -- diff ) {
        for ( int j = diff + 1 ; j < MAXN ; ++ j ) {
            for ( int bit = 0 ; bit < 11 ; ++ bit ) {
                for ( int hh = 0 ; hh < 2 ; ++ hh ) {
                    sm[ id ][ j ][ bit ][ hh ] += dp[ id ][ diff ][ bit ][ hh ] ;
                }
            }
        }
    }
}

void solve ( ) {
    ++ test_id ;
    for ( int i = 0 ; i < 3 ; ++ i ) {
        cin >> lim[ i ].fi ;
    }
    for ( int i = 0 ; i < 3 ; ++ i ) {
        cin >> lim[ i ].se ;
    }
    for ( int i = 0 ; i < 3 ; ++ i ) {
        proc ( i ) ;
    }
    ans = 0 ;
    for ( int mx = 0 ; mx < MAXN - 1 ; ++ mx ) {
        for ( int bit = 0 ; bit < 11 ; ++ bit ) {
            for ( int x = 0 ; x < 2 ; ++ x ) {
                for ( int y = 0 ; y < 2 ; ++ y ) {
                    for ( int z = 0 ; z < 2 ; z ++ ) {
                        for ( int small1 = 0 ; small1 < 2 ; ++ small1 ) {
                            for ( int small2 = 0 ; small2 < 2 ; ++ small2 ) {
                                for ( int small3 = 0 ; small3 < 2 ; ++ small3 ) {
                                    if ( small1 + small2 + small3 == 0 ) { continue ; }
                                    ull coef = 1 ;
                                    if ( small1 == 0 ) { coef = coef * sm[ 0 ][ mx ][ bit ][ x ] ; }
                                    else { coef = coef * dp[ 0 ][ mx ][ bit ][ x ] ; }
                                    
                                    if ( small2 == 0 ) { coef = coef * sm[ 1 ][ mx ][ bit ][ y ] ; }
                                    else { coef = coef * dp[ 1 ][ mx ][ bit ][ y ] ; }

                                    if ( small3 == 0 ) { coef = coef * sm[ 2 ][ mx ][ bit ][ z ] ; }
                                    else { coef = coef * dp[ 2 ][ mx ][ bit ][ z ] ; }

                                    int cnt = 0 ;
                                    cnt = x ^ y ^ z ;
                                    if ( ( mx & ( 1 << bit ) ) > 0 ) { cnt ^= 1 ; }
                                    if ( cnt == 1 ) {
                                        ans = ( ans + ( 1 << bit ) * coef ) ;
                                    }
                                }
                            }
                        }
                    }
                }
            }
        }
    }
    cout << "Case #" << test_id << ": " << ans << "\n" ;
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; cin >> t ; 
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}