Problem: One must train much to do well on wizardry contests. So, there are numerous wizardry schools and magic fees.

One of such magic schools consists of n tours. A winner of each tour gets a huge prize. The school is organised quite far away, so one will have to take all the prizes home in one go. And the bags that you've brought with you have space for no more than k huge prizes.

Besides the fact that you want to take all the prizes home, you also want to perform well. You will consider your performance good if you win at least l tours.

In fact, years of organizing contests proved to the organizers that transporting huge prizes is an issue for the participants. Alas, no one has ever invented a spell that would shrink the prizes... So, here's the solution: for some tours the winner gets a bag instead of a huge prize. Each bag is characterized by number ai — the number of huge prizes that will fit into it.

You already know the subject of all tours, so you can estimate the probability pi of winning the i-th tour. You cannot skip the tour under any circumstances.

Find the probability that you will perform well on the contest and will be able to take all won prizes home (that is, that you will be able to fit all the huge prizes that you won into the bags that you either won or brought from home).

Input

The first line contains three integers n, l, k (1 ≤ n ≤ 200, 0 ≤ l, k ≤ 200) — the number of tours, the minimum number of tours to win, and the number of prizes that you can fit in the bags brought from home, correspondingly.

The second line contains n space-separated integers, pi (0 ≤ pi ≤ 100) — the probability to win the i-th tour, in percents.

The third line contains n space-separated integers, ai (1 ≤ ai ≤ 200) — the capacity of the bag that will be awarded to you for winning the i-th tour, or else -1, if the prize for the i-th tour is a huge prize and not a bag.

Output

Print a single real number — the answer to the problem. The answer will be accepted if the absolute or relative error does not exceed 10 - 6.

Examples

Input

3 1 0
10 20 30
-1 -1 2


Output

0.300000000000


Input

1 1 1
100
123


Output

1.000000000000

Note

In the first sample we need either win no tour or win the third one. If we win nothing we wouldn't perform well. So, we must to win the third tour. Other conditions will be satisfied in this case. Probability of wining the third tour is 0.3.

In the second sample we win the only tour with probability 1.0, and go back home with bag for it.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long MAXN = 205;
const long long INF = 200;
long long n, l, beg, p[MAXN], n1, n2;
double dp1[MAXN][MAXN], dp2[MAXN][MAXN][MAXN], sum[MAXN];
vector<double> win1, lose1, win2, lose2;
vector<long long> pack;
int main() {
  while (~scanf("%lld %lld %lld", &n, &l, &beg)) {
    for (long long i = 1; i <= n; i++) {
      scanf("%lld", &p[i]);
    }
    for (long long i = 1; i <= n; i++) {
      long long x;
      scanf("%lld", &x);
      if (x == -1) {
        win1.push_back(p[i] * 1.0 / 100);
        lose1.push_back((100 - p[i]) * 1.0 / 100);
        n1++;
      } else {
        win2.push_back(p[i] * 1.0 / 100);
        lose2.push_back((100 - p[i]) * 1.0 / 100);
        pack.push_back(x);
        n2++;
      }
    }
    dp1[0][0] = 1;
    dp2[0][0][beg] = 1;
    for (long long i = 1; i <= n1; i++) {
      for (long long j = 0; j < i; j++) {
        dp1[i][j + 1] += dp1[i - 1][j] * win1[i - 1];
        dp1[i][j] += dp1[i - 1][j] * lose1[i - 1];
      }
    }
    for (long long i = 1; i <= n2; i++) {
      for (long long j = 0; j < i; j++) {
        for (long long k = 0; k <= INF; k++) {
          dp2[i][j + 1][min(k + pack[i - 1], 200ll)] +=
              dp2[i - 1][j][k] * win2[i - 1];
          dp2[i][j][k] += dp2[i - 1][j][k] * lose2[i - 1];
        }
      }
    }
    double ans = 0;
    for (long long i = 0; i <= n2; i++) {
      for (long long j = 0; j <= INF; j++) {
        sum[j] = 0;
      }
      sum[0] = dp2[n2][i][0];
      for (long long j = 1; j <= INF; j++) {
        sum[j] = sum[j - 1] + dp2[n2][i][j];
      }
      for (long long j = max(0ll, l - i); j <= n1; j++) {
        double pos;
        if (!j) {
          pos = sum[INF];
        } else {
          pos = sum[INF] - sum[j - 1];
        }
        ans += dp1[n1][j] * pos;
      }
    }
    printf("%.12f\n", ans);
  }
}