Two opposite vertices of a rectangular parallelepiped A, whose edges are parallel to the coordinate axes, have coordinates (0, 0, 0) and (u, v, w) respectively (0 < u < 1000, 0 < v < 1000, 0 < w < 1000).

Each of the n points of the set S is defined by its coordinates (x(i), y(i), z(i)), 1 ≤ i ≤ n ≤ 50. No pair of points of the set S lies on the straight line parallel to some side of the parallelepiped A.

You are to find a rectangular parallelepiped G of the maximal volume such that all its sides are parallel to the edges of A, G lies entirely within A (G and A may have common boundary points) and no point of S lies inside G (but may lie on its boundary).

The first line consists of the numbers u, v, w separated with a space. The second line contains an integer n. The third, …, (n+2)-nd line – the numbers x(i), y(i), z(i) separated with a space.

All coordinates are non-negative, not greater than 1000 and written with not more than two digits after a decimal point.

One number – the volume of G with two digits after a decimal point. If the true volume has more than two digitrs after a decimal point you should round off the result to two digits after a decimal opint according to the common mathematical rules.