package q3xx;

import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.InputMismatchException;

public class Q326_3 {
	InputStream is;
	PrintWriter out;
	String INPUT = "";
	
	double[][] makeT(int n, double p)
	{
		double[][] t = new double[n][n];
		// p+(1-p)/(n-1)*(i-1)  (1-p)/(n-1)*(n-2-i)
		for(int j = 0;j < n;j++){
			double[] dp = new double[j+1]; // 前に何人いるか
			dp[j] = 1.;
			for(int i = 0;i < n-1;i++){
				t[i][j] = dp[0]*p;
				for(int k = 1;k <= j;k++){
					t[i][j] += dp[k]*(1-p)/(n-1-i);
				}
				dp[0] *= 1.-p;
				for(int k = 1;k <= j;k++){
					// 前にk人いるとき、前の人が選ばれる確率はp+(1-p)/(n-1-i)*(k-1)
					dp[k-1] += dp[k] * (p+(1-p)/(n-1-i)*(k-1));
					dp[k] = dp[k] * ((1-p)/(n-1-i)*(n-1-i-(k-1)-1));
				}
			}
		}
		for(int j = 0;j < n;j++){
			double q = 1;
			for(int i = 0;i < n-1;i++)q -= t[i][j];
			t[n-1][j] = q;
		}
		return t;
	}
	
	void solve()
	{
		int n = ni();
		double pa = nd(), pb = nd();
		int[] a = na(n);
		int[] b = na(n);
		Arrays.sort(a);
		Arrays.sort(b);
		
		double[][] ta = makeT(n, pa);
		double[][] tb = makeT(n, pb);
//		for(double[] row : ta){
//			tr(row);
//		}
		// 0.7 0.1 0.1 0.1
		// 0.21 0.52 0.135 0.135
		// 0.063 
		
		double E = 0;
		for(int i = 0;i < n;i++){
			double qb = 0;
			double scb = 0;
			int p = 0;
			for(int j = 0;j < n;j++){
				while(p < n && a[j] > b[p]){
					qb += tb[i][p];
					scb += tb[i][p] * b[p];
					p++;
				}
				E += ta[i][j] * (a[j] * qb + scb);
			}
		}
		out.printf("%.12f\n", E);
	}

	void run() throws Exception
	{
		is = INPUT.isEmpty() ? System.in : new ByteArrayInputStream(INPUT.getBytes());
		out = new PrintWriter(System.out);
		
		long s = System.currentTimeMillis();
		solve();
		out.flush();
		if(!INPUT.isEmpty())tr(System.currentTimeMillis()-s+"ms");
	}
	
	public static void main(String[] args) throws Exception { new Q326_3().run(); }
	
	private byte[] inbuf = new byte[1024];
	private int lenbuf = 0, ptrbuf = 0;
	
	private int readByte()
	{
		if(lenbuf == -1)throw new InputMismatchException();
		if(ptrbuf >= lenbuf){
			ptrbuf = 0;
			try { lenbuf = is.read(inbuf); } catch (IOException e) { throw new InputMismatchException(); }
			if(lenbuf <= 0)return -1;
		}
		return inbuf[ptrbuf++];
	}
	
	private boolean isSpaceChar(int c) { return !(c >= 33 && c <= 126); }
	private int skip() { int b; while((b = readByte()) != -1 && isSpaceChar(b)); return b; }
	
	private double nd() { return Double.parseDouble(ns()); }
	private char nc() { return (char)skip(); }
	
	private String ns()
	{
		int b = skip();
		StringBuilder sb = new StringBuilder();
		while(!(isSpaceChar(b))){ // when nextLine, (isSpaceChar(b) && b != ' ')
			sb.appendCodePoint(b);
			b = readByte();
		}
		return sb.toString();
	}
	
	private char[] ns(int n)
	{
		char[] buf = new char[n];
		int b = skip(), p = 0;
		while(p < n && !(isSpaceChar(b))){
			buf[p++] = (char)b;
			b = readByte();
		}
		return n == p ? buf : Arrays.copyOf(buf, p);
	}
	
	private char[][] nm(int n, int m)
	{
		char[][] map = new char[n][];
		for(int i = 0;i < n;i++)map[i] = ns(m);
		return map;
	}
	
	private int[] na(int n)
	{
		int[] a = new int[n];
		for(int i = 0;i < n;i++)a[i] = ni();
		return a;
	}
	
	private int ni()
	{
		int num = 0, b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private long nl()
	{
		long num = 0;
		int b;
		boolean minus = false;
		while((b = readByte()) != -1 && !((b >= '0' && b <= '9') || b == '-'));
		if(b == '-'){
			minus = true;
			b = readByte();
		}
		
		while(true){
			if(b >= '0' && b <= '9'){
				num = num * 10 + (b - '0');
			}else{
				return minus ? -num : num;
			}
			b = readByte();
		}
	}
	
	private static void tr(Object... o) { System.out.println(Arrays.deepToString(o)); }
}