#include<bits/stdc++.h>
using namespace std;
#define i64 __int128
#define ll long long
#define pb push_back
#define fi first
#define se second
#define pii pair<int,int>
#define lowbit(i) i&(-i)
const int N = 2077; 
const double inf = 1e18;
int n,m,H,S,T2,T1,sp[N];
double p[N],f[N][10][10],g[N][N],h[N];
void solve1(){
    for(int i=1;i<=n;i++){
        for(int j=1;j<=H;j++){
            g[i][j] = inf;
        }
    }
    for(int i=n;i>=1;i--){
        for(int j=1;j<=H;j++){
            if(j==1){
                g[i][j] = (g[i+1][1]*p[i]+(1-p[i])*T2+1)/p[i];
            }else{
                g[i][j] = p[i]*g[i+1][j]+(1-p[i])*g[i][j-1]+1;
            }
        }
    }
    cout << g[1][H] << '\n';
}
int main(){
    cin.tie(0),cout.tie(0);
    ios::sync_with_stdio(0);
    cout << fixed << setprecision(12);
    cin >> n >> H >> S;H--;
    for(int i=1;i<=n;i++) cin >> p[i],p[i] /= 100;
    cin >> m;
    for(int i=1,x;i<=m;i++){
        cin >> x;
        sp[x] = 1;
    }
    cin >> T1 >> T2;
    if(T2<=T1 || !S){
        solve1();
        exit(0);
    }
    for(int i=1;i<=n;i++) for(int j=1;j<=H;j++) for(int k=0;k<=S;k++) f[i][j][k] = inf;
    for(int i=n;i>=1;i--){ 
        if(!sp[i]){  
            for(int j=1;j<=H;j++){
                for(int k=0;k<=S;k++){
                    if(j==1){
                        if(k) f[i][j][k] = (p[i]*f[i+1][j][k]+(1-p[i])*(f[i][j][k-1]+T1)+1);
                        else f[i][j][k] = (p[i]*f[i+1][j][k]+(1-p[i])*T2+1)/p[i];
                    }else{
                        f[i][j][k] = p[i]*f[i+1][j][k]+(1-p[i])*f[i][j-1][k]+1;
                    }
                }
            }
        }else{
            for(int l=1;l<=1;l++){
                h[l] = (p[i]*f[i+1][l][S]+(1-p[i])*T1+1)/p[i];
                for(int t=l-1;t>=1;t--) h[t] = h[t+1]+T1;
                for(int t=l+1;t<=H;t++) h[t] = p[i]*f[i+1][t][S]+(1-p[i])*(h[t-1])+1;
                for(int t=1;t<=H;t++) f[i][t][S] = min(f[i][t][S],h[t]); 
            }
            for(int j=1;j<=H;j++){
                for(int k=S-1;k>=0;k--){
                    f[i][j][k] = min(f[i][j][k],f[i][j][k+1]);
                }
            }
        }
    }
    cout << f[1][H][S] << '\n';
    return 0;
}