using System; using System.IO; using System.Linq; using System.Text; using System.Collections.Generic; using Enu = System.Linq.Enumerable; class Program { public void Solve() { int N = Reader.Int(); double PA = Reader.Double(), PB = Reader.Double(); int[] A = Reader.IntArray(N), B = Reader.IntArray(N); Array.Sort(A); Array.Sort(B); var ProbA = GetProb(A, PA); var ProbB = GetProb(B, PB); double ans = 0; for (int ai = 0; ai < N; ai++) for (int bi = 0; bi < N; bi++) if (A[ai] > B[bi]) for (int p = 0; p < N; p++) ans += (A[ai] + B[bi]) * ProbA[ai, p] * ProbB[bi, p]; Console.WriteLine(ans); } double[,] tmp = new double[1 << 20, 20]; double[,] GetProb(int[] X, double p) { int N = X.Length; for (int mask = 0; mask < (1 << N); mask++) for (int i = 0; i < N; i++) tmp[mask, i] = 0; tmp[0, 0] = 1; for (int mask = 0; mask < (1 << N); mask++) { int rem = N - BitCount(mask); int min = 0; for (int i = 0; i < N; i++) if ((mask >> i & 1) == 0) { min = i; break; } double currProb = 0; for (int i = 0; i < N; i++) currProb += tmp[mask, i]; for (int next = 0; next < N; next++) if ((mask >> next & 1) == 0) { double selectProb = (rem == 1) ? 1 : (next == min) ? p : (1 - p) / (rem - 1); tmp[mask | 1 << next, next] += currProb * selectProb; } } var res = new double[N, N]; // i, at for (int mask = 1; mask < (1 << N); mask++) { int at = BitCount(mask) - 1; for (int i = 0; i < N; i++) res[i, at] += tmp[mask, i]; } return res; } int BitCount(int x) { return x == 0 ? 0 : 1 + BitCount(x & x - 1); } } class Entry { static void Main() { new Program().Solve(); } } class Reader { private static TextReader reader = Console.In; private static readonly char[] separator = { ' ' }; private static readonly StringSplitOptions op = StringSplitOptions.RemoveEmptyEntries; private static string[] A = new string[0]; private static int i; private static void Init() { A = new string[0]; } public static void Set(TextReader r) { reader = r; Init(); } public static void Set(string file) { reader = new StreamReader(file); Init(); } public static bool HasNext() { return CheckNext(); } public static string String() { return Next(); } public static int Int() { return int.Parse(Next()); } public static long Long() { return long.Parse(Next()); } public static double Double() { return double.Parse(Next()); } public static int[] IntLine() { return Array.ConvertAll(Split(Line()), int.Parse); } public static int[] IntArray(int N) { return Enu.Range(0, N).Select(i => Int()).ToArray(); } public static int[][] IntTable(int H) { return Enu.Range(0, H).Select(i => IntLine()).ToArray(); } public static string[] StringArray(int N) { return Enu.Range(0, N).Select(i => Line()).ToArray(); } public static string Line() { return reader.ReadLine().Trim(); } private static string[] Split(string s) { return s.Split(separator, op); } private static string Next() { CheckNext(); return A[i++]; } private static bool CheckNext() { if (i < A.Length) return true; string line = reader.ReadLine(); if (line == null) return false; if (line == "") return CheckNext(); A = Split(line); i = 0; return true; } }