import java.io.*; import java.util.*; public class Main_yukicoder173 { public static void main(String[] args) { Scanner sc = new Scanner(System.in); Printer pr = new Printer(System.out); int n = sc.nextInt(); double pa = sc.nextDouble(); double pb = sc.nextDouble(); int[] a = new int[n]; int[] b = new int[n]; for (int i = 0; i < n; i++) { a[i] = sc.nextInt(); } for (int i = 0; i < n; i++) { b[i] = sc.nextInt(); } Arrays.sort(a); Arrays.sort(b); int mask = (0x1 << n) - 1; // dpa[i] : iで表されるカードが出された状態になる確率 double[] dpa = new double[0x1 << n]; double[] dpb = new double[0x1 << n]; dpa[0] = 1; dpb[0] = 1; // aa[i][j] : i番目のカードがj番目に出される確率 double[][] aa = new double[n][n]; double[][] bb = new double[n][n]; for (int i = 0; i < 0x1 << n; i++) { int mini = Integer.numberOfTrailingZeros(~i & mask); for (int j = 0; j < n; j++) { if ((i & 0x1 << j) != 0) { continue; } int k = Integer.bitCount(i); if (k == n - 1) { dpa[i | 0x1 << j] += dpa[i]; dpb[i | 0x1 << j] += dpb[i]; aa[j][k] += dpa[i]; bb[j][k] += dpb[i]; } else if (j == mini) { dpa[i | 0x1 << j] += dpa[i] * pa; dpb[i | 0x1 << j] += dpb[i] * pb; aa[j][k] += dpa[i] * pa; bb[j][k] += dpb[i] * pb; } else { dpa[i | 0x1 << j] += dpa[i] * (1 - pa) / (n - k - 1); dpb[i | 0x1 << j] += dpb[i] * (1 - pb) / (n - k - 1); aa[j][k] += dpa[i] * (1 - pa) / (n - k - 1); bb[j][k] += dpb[i] * (1 - pb) / (n - k - 1); } } } double ret = 0; for (int i = 0; i < n; i++) { for (int j = 0; j < n; j++) { if (a[i] <= b[j]) { continue; } for (int k = 0; k < n; k++) { ret += (a[i] + b[j]) * aa[i][k] * bb[j][k]; } } } pr.printf("%.10f\n", ret); pr.close(); sc.close(); } private static class Printer extends PrintWriter { Printer(PrintStream out) { super(out); } } }