#include<bits/stdc++.h>
using namespace std;
#define FOR(i,s,t) for(int i=(s),_t=(t); i<=_t; ++i)
typedef double db;
typedef long long ll;
const int N=1.1e6+50;
typedef complex<db> comp;
const db pi=acos(-1);
void DFT(comp *a,int n,int f) {
    static comp ww[N],iw[N];
    static int rev[N],pn=0;
    if(pn!=n) {
        FOR(i,0,n-1) ww[i]=comp(cos(pi*2/n*i),sin(pi*2/n*i));
        FOR(i,0,n-1) iw[i]=conj(ww[i]);
        FOR(i,0,n-1) rev[i]=(rev[i>>1]>>1)|((i&1)*(n>>1));
        pn=n;
    }
    comp *w=f>0?ww:iw;
    FOR(i,0,n-1) if(rev[i]<i) swap(a[rev[i]],a[i]);
    for(int l=2; l<=n; l<<=1) {
        for(comp *p=a; p!=a+n; p+=l) {
            for(int i=0,m=l>>1; i<m; ++i) {
                comp t=p[i+m];
                p[i+m]=p[i]+t*w[n/l*(i+m)];
                p[i]=p[i]+t*w[n/l*i];
            }
        }
    }
    if(f<0) FOR(i,0,n-1) a[i]/=n;
}
void Poly_Mul(const db *A,int LenA,const db *B,int LenB,db *C) {
    // FOR(i,0,LenA-1) FOR(j,0,LenB-1) C[i+j]+=A[i]*B[j];
    static comp a[N],b[N];
    int n=1;for(; n<LenA+LenB; n<<=1);
    FOR(i,0,n-1) a[i]=b[i]={0,0};
    FOR(i,0,LenA-1) a[i]={A[i],0};
    FOR(i,0,LenB-1) b[i]={B[i],0};
    DFT(a,n,1);
    DFT(b,n,1);
    FOR(i,0,n-1) b[i]*=a[i];
    // FOR(i,0,n-1) b[i]=(a[i]*a[i]-conj(a[i?n-i:0]*a[i?n-i:0]))*comp(0,-0.25);
    DFT(b,n,-1);
    FOR(i,0,n-1) C[i]=b[i].real();
}
db p[N],q[N],P[N];
db Q[N];
db A[N],B[N];
db sum[N];
int n,K;
db pr;
int e=0;
db qry(int i,int r) {
    db t=0,t0=0,t1=0;
    FOR(j,1,n) {
        if(j<=r) {
            t+=p[j]*(sum[n*3-2]-sum[n-2+j]);
        } else {
            t0+=p[j]*pr;
        }
    }
    return t+max(t0,t1);
}
db sum0[N];
int main() {
    scanf("%d%d",&n,&K);
    FOR(i,1,n) scanf("%lf",&p[i]),P[i]=P[i-1]+p[i];
    FOR(i,1,n*2-2) scanf("%lf",&q[i]),Q[i]=Q[i-1]+q[i];
    FOR(i,1,n*2-2) A[i]=q[n*2-1-i];
    Poly_Mul(p,n+1,A,n*2-1,B);
    FOR(i,1,n+n*2-1) sum[i]=sum[i-1]+B[i];
    
    db s0=0,s1=sum[n*3-2]-sum[n*2-1];
    db s2=0;
    FOR(i,1,n) {
        sum0[i]=sum0[i-1]+p[i]*(sum[n*3-2]-sum[n-1+i]);

        s0+=Q[n-i]*p[i];
        s1=max(s1,s0+sum[n*3-2]-sum[n*2-1+i]);
        // cerr << s1 << endl;
    }
    pr=s1;
    int j=n;
    FOR(i,2,K) {
        while(j && pr>=(sum[n*3-2]-sum[n-1+j])) --j;
        pr=sum0[j]+pr*(P[n]-P[j]);
    }
    printf("%.9lf\n",pr);
    return 0;
}