import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines

N,PA,PB=readline().split()
N=int(N)
PA=float(PA)
PB=float(PB)
A=list(map(int,readline().split()))
B=list(map(int,readline().split()))
A.sort()
B.sort()
dpA=[0]*(1<<N)
dpA[(1<<N)-1]=1
for bit in range((1<<N)-1,-1,-1):
    cnt=sum(bit>>i&1 for i in range(N))
    for i in range(N):
        if bit>>i&1:
            break
    for j in range(N):
        if not bit>>j&1:
            continue
        if i==j:
            if cnt==1:
                dpA[bit^1<<j]+=dpA[bit]
            else:
                dpA[bit^1<<j]+=dpA[bit]*PA
        else:
            dpA[bit^1<<j]+=dpA[bit]*(1-PA)/(cnt-1)
dpB=[0]*(1<<N)
dpB[(1<<N)-1]=1
for bit in range((1<<N)-1,-1,-1):
    cnt=sum(bit>>i&1 for i in range(N))
    for i in range(N):
        if bit>>i&1:
            break
    for j in range(N):
        if not bit>>j&1:
            continue
        if i==j:
            if cnt==1:
                dpB[bit^1<<j]+=dpB[bit]
            else:
                dpB[bit^1<<j]+=dpB[bit]*PB
        else:
            dpB[bit^1<<j]+=dpB[bit]*(1-PB)/(cnt-1)
ans=0
cardA=[[0]*N for i in range(N+1)]
for bit in range(1,1<<N):
    cnt=sum(bit>>i&1 for i in range(N))
    for i in range(N):
        if bit>>i&1:
            break
    for j in range(N):
        if not bit>>j&1:
            continue
        if i==j:
            if cnt==1:
                cardA[cnt][j]+=dpA[bit]
            else:
                cardA[cnt][j]+=dpA[bit]*PA
        else:
            cardA[cnt][j]+=dpA[bit]*(1-PA)/(cnt-1)
cardB=[[0]*N for i in range(N+1)]
for bit in range(1,1<<N):
    cnt=sum(bit>>i&1 for i in range(N))
    for i in range(N):
        if bit>>i&1:
            break
    for j in range(N):
        if not bit>>j&1:
            continue
        if i==j:
            if cnt==1:
                cardB[cnt][j]+=dpB[bit]
            else:
                cardB[cnt][j]+=dpB[bit]*PB
        else:
            cardB[cnt][j]+=dpB[bit]*(1-PB)/(cnt-1)
for cnt in range(1+N):
    for i in range(N):
        for j in range(N):
            if A[i]>B[j]:
                ans+=cardA[cnt][i]*cardB[cnt][j]*(A[i]+B[j])
print(ans)