PROGRAMMING:Thinking problems of little H
Let's start with a thinking problem. Here are four integers, $$a, B, x, y $$. At the beginning, $$a / Ge x $$and $$B / Ge y $$. You can do the following no more than n times.
*Choose one of these $$a $$or $$B $$to reduce it by one. However, $$a $$cannot be smaller than $$x $$and $$B $$cannot be smaller than $$y $$.
Your task is to minimize $$a * B after no more than $$n $$operations$$
You have to answer t independent cases
###Input format:
The first line of input contains an integer$$ T (1 / ge t / Ge 2 * 10 ^ 4) $$the number of test cases. Then there are t test cases.
The only line of the test case contains five integers$$ a. B, x, y $$and $$n (1, Le, a, B, x, y, N, Le 10 ^ 9) $$. Additional restrictions on input: $$a / Ge x $$and $$B / Ge y $$have always been.
###Output format:
For each test case, print an integer: minimize $$a * B after no more than $$n $$operations$$
###Input example:
```in
seven
10 10 8 5 3
12 8 8 7 2
12343 43 4543 39 123212
1000000000 1000000000 1 1 1
1000000000 1000000000 1 1 1000000000
10 11 2 1 5
10 11 9 1 10
```
###Output example:
```out
seventy
seventy-seven
one hundred and seventy-seven thousand one hundred and seventy-seven
nine hundred and ninety-nine thousand nine hundred and ninety-nine trillion and nine hundred and ninety-nine billion
nine hundred and ninety-nine million nine hundred and ninety-nine thousand nine hundred and ninety-nine
fifty-five
ten
```
###Exemplar explanation
In the first test case of the example, you need to reduce B three times, 10 ⋅ 7 = 70
In the second test case of the example, you need to reduce a once, B once and get 11 ⋅ 7 = 77
In the sixth test case of the example, you need to reduce a five times, 5 ⋅ 11 = 55
In the seventh test case of the example, you need to reduce B ten times, 10 ⋅ 1 = 10. < br > < br > < br > < br > < br > < br > in this case, you need to reduce B ten times, 10 ⋅ 1 = 10
answer：If there is no answer, please comment
*Choose one of these $$a $$or $$B $$to reduce it by one. However, $$a $$cannot be smaller than $$x $$and $$B $$cannot be smaller than $$y $$.
Your task is to minimize $$a * B after no more than $$n $$operations$$
You have to answer t independent cases
###Input format:
The first line of input contains an integer$$ T (1 / ge t / Ge 2 * 10 ^ 4) $$the number of test cases. Then there are t test cases.
The only line of the test case contains five integers$$ a. B, x, y $$and $$n (1, Le, a, B, x, y, N, Le 10 ^ 9) $$. Additional restrictions on input: $$a / Ge x $$and $$B / Ge y $$have always been.
###Output format:
For each test case, print an integer: minimize $$a * B after no more than $$n $$operations$$
###Input example:
```in
seven
10 10 8 5 3
12 8 8 7 2
12343 43 4543 39 123212
1000000000 1000000000 1 1 1
1000000000 1000000000 1 1 1000000000
10 11 2 1 5
10 11 9 1 10
```
###Output example:
```out
seventy
seventy-seven
one hundred and seventy-seven thousand one hundred and seventy-seven
nine hundred and ninety-nine thousand nine hundred and ninety-nine trillion and nine hundred and ninety-nine billion
nine hundred and ninety-nine million nine hundred and ninety-nine thousand nine hundred and ninety-nine
fifty-five
ten
```
###Exemplar explanation
In the first test case of the example, you need to reduce B three times, 10 ⋅ 7 = 70
In the second test case of the example, you need to reduce a once, B once and get 11 ⋅ 7 = 77
In the sixth test case of the example, you need to reduce a five times, 5 ⋅ 11 = 55
In the seventh test case of the example, you need to reduce B ten times, 10 ⋅ 1 = 10. < br > < br > < br > < br > < br > < br > in this case, you need to reduce B ten times, 10 ⋅ 1 = 10
answer：If there is no answer, please comment