#D12650. Matrix
Matrix
Matrix
Problem
Given a sequence of length and a sequence of length .
Define the matrix consisting of rows and columns as follows. $ C_ {i, j} = A_i \ times B_j (1 \ leq i \ leq H, 1 \ leq j \ leq W) $
Process the following four types of queries a total of times.
Query 1 v
Query 2 v
Query 3 $ C_ {i, j} (a \ leq i \ leq b, c \ leq j \ leq d) Output the minimum value of $ and its number
Query 4 $ C_ {i, j} (a \ leq i \ leq b, c \ leq j \ leq d) Output the maximum value of $ and its number
For details, refer to sample input / output.
Constraints
The input satisfies the following conditions.
For each query, the input satisfies the following conditions.
Input
The input is given in the following format.
... ... ...
Each query is given in one of the following four formats.
All inputs are given as integers. , , are given on the first line, separated by blanks. In the second row, the element () of the sequence is given, separated by blanks. In the third row, the element () of the sequence is given, separated by blanks. Queries are given on the 4th and subsequent lines, separated by line breaks. All numbers in each query are separated by blanks.
Output
For each query 3 and query 4, output the value and number on one line, separated by blanks.
Examples
Input
4 4 7 1 2 3 4 1 2 3 4 3 2 3 2 3 4 2 3 2 3 3 1 1 1 1 4 1 1 1 1 1 1 1 1 3 1 4 1 2 4 2 3 2 4
Output
4 1 9 1 1 1 1 1 2 2 12 1
Input
4 4 6 1 1 1 1 1 1 1 1 3 1 4 1 4 4 1 4 1 4 1 2 3 1 2 2 3 1 3 1 4 1 4 4 1 4 1 4
Output
1 16 1 16 1 4 4 4
Input
4 4 7 0 1 0 1 1 0 1 0 3 2 4 1 3 4 1 4 1 4 1 1 4 -1 3 1 3 1 3 1 3 3 2 2 3 3 -2 3 2 4 2 4
Output
0 5 1 4 -1 4 -1 1
Input
36 4 20 -523 -460 -536 -885 652 782 513 -558 -521 -808 124 -708 -943 52 -856 -755 -958 913 380 -767 373 -731 -492 213 538 392 -39 509 -840 135 78 -285 -241 522 -572 -915 -691 -16 812 -385 4 7 17 4 4 3 24 33 1 1 4 3 35 2 4 3 28 32 4 4 2 3 3 438 3 7 15 1 1 4 2 17 4 4 3 24 28 2 4 4 15 16 4 4 4 18 29 1 1 3 24 27 2 4 2 2 3 -828 3 18 23 3 3 1 27 31 -701 2 2 3 298 1 21 32 237 2 3 3 -71 1 14 29 772 4 13 19 3 3 3 19 34 1 2
Output
368830 1 -371758 1 741356 1 -195965 1 -354483 1 368830 1 -207130 1 329560 1 580440 1 -207130 1 -323674 1 1093565 1 -1068977 1
inputFormat
outputFormat
Output the minimum value of $ and its number
Query 4 $ C_ {i, j} (a \ leq i \ leq b, c \ leq j \ leq d) Output the maximum value of $ and its number
For details, refer to sample input / output.
Constraints
The input satisfies the following conditions.
For each query, the input satisfies the following conditions.
Input
The input is given in the following format.
... ... ...
Each query is given in one of the following four formats.
All inputs are given as integers. , , are given on the first line, separated by blanks. In the second row, the element () of the sequence is given, separated by blanks. In the third row, the element () of the sequence is given, separated by blanks. Queries are given on the 4th and subsequent lines, separated by line breaks. All numbers in each query are separated by blanks.
Output
For each query 3 and query 4, output the value and number on one line, separated by blanks.
Examples
Input
4 4 7 1 2 3 4 1 2 3 4 3 2 3 2 3 4 2 3 2 3 3 1 1 1 1 4 1 1 1 1 1 1 1 1 3 1 4 1 2 4 2 3 2 4
Output
4 1 9 1 1 1 1 1 2 2 12 1
Input
4 4 6 1 1 1 1 1 1 1 1 3 1 4 1 4 4 1 4 1 4 1 2 3 1 2 2 3 1 3 1 4 1 4 4 1 4 1 4
Output
1 16 1 16 1 4 4 4
Input
4 4 7 0 1 0 1 1 0 1 0 3 2 4 1 3 4 1 4 1 4 1 1 4 -1 3 1 3 1 3 1 3 3 2 2 3 3 -2 3 2 4 2 4
Output
0 5 1 4 -1 4 -1 1
Input
36 4 20 -523 -460 -536 -885 652 782 513 -558 -521 -808 124 -708 -943 52 -856 -755 -958 913 380 -767 373 -731 -492 213 538 392 -39 509 -840 135 78 -285 -241 522 -572 -915 -691 -16 812 -385 4 7 17 4 4 3 24 33 1 1 4 3 35 2 4 3 28 32 4 4 2 3 3 438 3 7 15 1 1 4 2 17 4 4 3 24 28 2 4 4 15 16 4 4 4 18 29 1 1 3 24 27 2 4 2 2 3 -828 3 18 23 3 3 1 27 31 -701 2 2 3 298 1 21 32 237 2 3 3 -71 1 14 29 772 4 13 19 3 3 3 19 34 1 2
Output
368830 1 -371758 1 741356 1 -195965 1 -354483 1 368830 1 -207130 1 329560 1 580440 1 -207130 1 -323674 1 1093565 1 -1068977 1
样例
4 4 7
1 2 3 4
1 2 3 4
3 2 3 2 3
4 2 3 2 3
3 1 1 1 1
4 1 1 1 1
1 1 1 1
3 1 4 1 2
4 2 3 2 4
4 1
9 1
1 1
1 1
2 2
12 1
</p>