Package for this problem was not updated by the problem writer or Codeforces administration after we’ve upgraded the judging servers. To adjust the time limit constraint, solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then value 800 ms will be displayed and used to determine the verdict.

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ACM-ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

E. Piglet's Birthday

time limit per test

2 secondsmemory limit per test

256 megabytesinput

standard inputoutput

standard outputPiglet 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 *u*_{i}, took from it some pots *k*_{i}, tasted the honey from each pot and put all those pots on some shelf *v*_{i}. As Winnie chose the pots, he followed his intuition. And that means that among all sets of *k*_{i} pots on shelf *u*_{i}, 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* ≤ 10^{5}) — the number of shelves at Winnie's place. The second line contains *n* integers *a*_{i} (1 ≤ *i* ≤ *n*, 0 ≤ *a*_{i} ≤ 100) — the number of honey pots on a shelf number *i*.

The next line contains integer *q* (1 ≤ *q* ≤ 10^{5}) — 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 *u*_{i}, *v*_{i} and *k*_{i} (1 ≤ *u*_{i}, *v*_{i} ≤ *n*, 1 ≤ *k*_{i} ≤ 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

Codeforces (c) Copyright 2010-2019 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Mar/20/2019 11:29:45 (f2).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|