Problem: Piglet has got a birthday today. His friend Winnie the Pooh wants to make the best present for him — a honey pot. Of course Winnie realizes that he won't manage to get the full pot to Piglet. In fact, he is likely to eat all the honey from the pot. And as soon as Winnie planned a snack on is way, the pot should initially have as much honey as possible. 

The day before Winnie the Pooh replenished his honey stocks. Winnie-the-Pooh has n shelves at home, each shelf contains some, perhaps zero number of honey pots. During the day Winnie came to the honey shelves q times; on the i-th time he came to some shelf ui, took from it some pots ki, tasted the honey from each pot and put all those pots on some shelf vi. As Winnie chose the pots, he followed his intuition. And that means that among all sets of ki pots on shelf ui, he equiprobably chooses one.

Now Winnie remembers all actions he performed with the honey pots. He wants to take to the party the pot he didn't try the day before. For that he must know the mathematical expectation of the number m of shelves that don't have a single untasted pot. To evaluate his chances better, Winnie-the-Pooh wants to know the value m after each action he performs.

Your task is to write a program that will find those values for him.

Input

The first line of the input contains a single number n (1 ≤ n ≤ 105) — the number of shelves at Winnie's place. The second line contains n integers ai (1 ≤ i ≤ n, 0 ≤ ai ≤ 100) — the number of honey pots on a shelf number i. 

The next line contains integer q (1 ≤ q ≤ 105) — the number of actions Winnie did the day before. Then follow q lines, the i-th of them describes an event that follows chronologically; the line contains three integers ui, vi and ki (1 ≤ ui, vi ≤ n, 1 ≤ ki ≤ 5) — the number of the shelf from which Winnie took pots, the number of the shelf on which Winnie put the pots after he tasted each of them, and the number of the pots Winnie tasted, correspondingly.

Consider the shelves with pots numbered with integers from 1 to n. It is guaranteed that Winnie-the-Pooh Never tried taking more pots from the shelf than it has.

Output

For each Winnie's action print the value of the mathematical expectation m by the moment when this action is performed. The relative or absolute error of each value mustn't exceed 10 - 9.

Examples

Input

3
2 2 3
5
1 2 1
2 1 2
1 2 2
3 1 1
3 2 2


Output

0.000000000000
0.333333333333
1.000000000000
1.000000000000
2.000000000000

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
#pragma comment(linker, "/stack:16777216")
using namespace std;
const int INF = 1 << 30;
const int MAX = 300000;
int n, m;
int A[MAX];
int B[MAX];
vector<pair<pair<int, int>, pair<int, int> > > Q[MAX];
int C[MAX][2];
double P[2][101];
double Bin[MAX][7];
double Sum[MAX];
int main() {
  for (int i = (0); i < (MAX); ++i) Bin[i][0] = 1.0;
  for (int i = (1); i < (MAX); ++i)
    for (int j = (1); j < (min(7, i + 1)); ++j)
      Bin[i][j] = Bin[i - 1][j] + Bin[i - 1][j - 1];
  cin >> n;
  for (int i = (0); i < (n); ++i) {
    scanf("%d", &A[i]);
    B[i] = A[i];
  }
  cin >> m;
  for (int i = (0); i < (m); ++i) {
    int u, v, w;
    scanf("%d%d%d", &u, &v, &w);
    u--;
    v--;
    Q[u].push_back(make_pair(make_pair(i, w), make_pair(u, v)));
    if (u != v) Q[v].push_back(make_pair(make_pair(i, w), make_pair(u, v)));
    C[i][0] = B[u];
    C[i][1] = B[v];
    B[u] -= w;
    B[v] += w;
  }
  int plus = 0;
  for (int i = (0); i < (n); ++i) {
    if (A[i] == 0) {
      plus++;
      continue;
    }
    memset(P, 0, sizeof(P));
    P[0][A[i]] = 1.0;
    int a = 0, b = 1;
    for (int j = (0); j < (Q[i].size()); ++j) {
      int u, v;
      u = Q[i][j].second.first;
      v = Q[i][j].second.second;
      int id, w;
      id = Q[i][j].first.first;
      w = Q[i][j].first.second;
      for (int k = (0); k < (A[i] + 1); ++k) P[b][k] = 0.0;
      for (int k = A[i]; k >= 0; k--) {
        if (v == i && u != i)
          P[b][k] += P[a][k];
        else {
          for (int c = 0; c <= w; c++) {
            if (c > k) break;
            if (w - c > C[id][0] - k) continue;
            P[b][k - c] += P[a][k] * (Bin[k][c] * Bin[C[id][0] - k][w - c]) /
                           Bin[C[id][0]][w];
          }
        }
      }
      int to = m - 1;
      if (j + 1 < Q[i].size()) to = Q[i][j + 1].first.first - 1;
      Sum[id] += P[b][0];
      Sum[to + 1] -= P[b][0];
      swap(a, b);
    }
  }
  double sum = 0;
  for (int i = (0); i < (m); ++i) {
    sum += Sum[i];
    printf("%0.10f\n", sum + plus);
  }
  return 0;
}