#include using namespace std; typedef long long ll; typedef vector< int > vi; typedef vector< vi > vvi; typedef vector< ll > vl; typedef vector< vl > vvl; typedef pair< int, int > pii; typedef vector< pii > vp; typedef vector< double > vd; typedef vector< vd > vvd; typedef vector< string > vs; template< class T1, class T2 > int upmin( T1 &x, T2 v ){ if( x > v ){ x = v; return 1; } return 0; } template< class T1, class T2 > int upmax( T1 &x, T2 v ){ if( x < v ){ x = v; return 1; } return 0; } const int INF = 0x3f3f3f3f; const int MAXN = 20; int N; double Pa, Pb; int A[ MAXN ]; int B[ MAXN ]; void init(){ cin >> N; cin >> Pa >> Pb; for( int i = 0; i < N; ++i ){ cin >> A[ i ]; } for( int i = 0; i < N; ++i ){ cin >> B[ i ]; } } double dp_a[ 1 << MAXN ]; double dp_b[ 1 << MAXN ]; double turn_id_a[ MAXN + 1 ][ MAXN + 1 ]; double turn_id_b[ MAXN + 1 ][ MAXN + 1 ]; void build_dp( int a[], double p, double dp[], double turn_id[][ MAXN + 1 ] ){ dp[ 0 ] = 1.0; for( int s = 0; s < 1 << N; ++s ){ int turn = __builtin_popcount( s ); int n = N - turn; int minv = INF; for( int i = 0; i < N; ++i ){ if( ~s & 1 << i ){ upmin( minv, a[ i ] ); } } for( int i = 0; i < N; ++i ){ if( ~s & 1 << i ){ if( a[ i ] == minv ){ dp[ s | 1 << i ] += dp[ s ] * ( n == 1 ? 1.0 : p ); turn_id[ turn ][ i ] += dp[ s ] * ( n == 1 ? 1.0 : p ); } else{ dp[ s | 1 << i ] += dp[ s ] * ( 1.0 - p ) / ( n - 1 ); turn_id[ turn ][ i ] += dp[ s ] * ( 1.0 - p ) / ( n - 1 ); } } } } } void preprocess(){ build_dp( A, Pa, dp_a, turn_id_a ); build_dp( B, Pb, dp_b, turn_id_b ); } void solve(){ double ans = 0.0; for( int i = 0; i < N; ++i ){ for( int j = 0; j < N; ++j ){ for( int k = 0; k < N; ++k ){ if( A[ j ] <= B[ k ] ) continue; ans += turn_id_a[ i ][ j ] * turn_id_b[ i ][ k ] * ( A[ j ] + B[ k ] ); } } } cout << fixed << setprecision( 10 ) << ans << endl; } signed main(){ ios::sync_with_stdio( 0 ); init(); preprocess(); solve(); return 0; }