Farmer Wowo is going to collect strawberries. The farm contains rows and columns. The intersection of the -th row and the -th column is denoted as cell . Initially, there is no strawberry on the farm. Beginning on the morning of the first day, a new strawberry grows from each cell every morning.

Wowo's home is at . Every afternoon, Wowo can move to one of the adjacent grids (left, right, up, or down) or stay where he is. Every evening, Wowo collects all strawberries in his current cell. After the collection, the number of strawberries in that cell becomes 0. The last collection will be in the -th day's evening.

The question is what the maximum number of strawberries Wowo can collect is. Please output the answer mod 998244353.

The first line contains one integer  -- the number of test cases.

Each test case contains 5 integers , , , .

For each test case, output one integer -- the maximum number of strawberries Wowo can collect. Please output the answer mod 998244353.

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

1
3
6
10
14