Bob decided to go on a trip. There are total $$N$$ kids on the trip. There are $$3$$ types of toys - 'Type-1', 'Type-2', and 'Type-3' available for the distribution among $$N$$ kids. Each of the kids is asked, what kind of toy he prefers from the current lot. If the kid does not like any toy from the current lot, then he or she would get a toy among the remaining types with equal probability.

Bob wants a 'Type-1' toy. He knows that there are $$A$$ 'Type-1' toys, $$B$$ 'Type-2' toys, and $$C$$ 'Type-3' toys. He noticed that he is at \(K^{th}\) position in the queue. He also knows that a random kid prefers 'Type-1' toys with probability \(P1\%\) and 'Type-2' toys with probability \(P2\%\). Obviously, if a kid does not prefer 'Type-1' and 'Type-2' toys, he or she prefers 'Type-3' toys.

Now he wants to know, what is his chance to get a 'Type-1' toy.

Input format

The first line contains an integer $$T$$ denoting the number of test cases.
The first line of each test case contains an integer $$N$$ denoting the total number of kids.
The second line of each test case contains three space-separated integers denoting the values of $$A$$, $$B$$, and $$C$$.
The third line of each test case contains an integer $$K$$ denoting the position of Lucky on the queue.
The fourth line of each test case contains two space-separated integers denoting the values of $$P1$$ and $$P2$$.

Output format

For each test case, print the Lucky’s probability to get a 'Type-1' toy in a new line. Print your answer modulo $$1e9+7$$.

Constraints

\(1 \le T \le 10\\ 0 \le A,B,C \le 200\\ 1 \le N \le A+B+C\\ 1 \le K \le N\\ 0 \le P1,P2 \le 100\ (P1+P2 \le 100)\)