Boxes

Nowadays almost any item can be bought and sold on the internet. The challenge is shipping. Before an item can be sent, it must be carefully packed in a cardboard box to protect it.

Items come in all shapes and sizes, so finding a box of just the right size can be difficult. If the box is too small, the item will not fit. If the box is unnecessarily large, shipping costs more, and the item is more likely to move around inside the box and get damaged.

Cardboard box manufacturers offer a fixed set of standard box sizes. Your task is to find the standard box with the smallest volume into which an item will fit.

Each box is a rectangular prism with a given length, width, and height. Each item is likewise a rectangular prism with a given length, width, and height. Before packing, an item may be rotated by any multiple of 90 degrees in any direction, but once packed its faces must be parallel to the faces of the box. An item fits into a box as long as each of its dimensions is less than or equal to the corresponding dimension of the box.

The first line contains a single integer $n$ ($0 < n < 1000$), the number of available box sizes. Each of the next $n$ lines contains three integers giving the length, width, and height of a box. The following line contains a single integer $m$ ($0 < m < 1000$), the number of items to be packaged. Each of the next $m$ lines contains three integers giving the length, width, and height of an item. All dimensions are in millimetres and range from $1\,\text{mm}$ to $2000\,\text{mm}$.

Output $m$ lines, one for each item. For each item, output a single integer: the volume (in $\text{mm}^3$) of the smallest box into which the item fits. The same box size may be reused for any number of items. If an item does not fit in any box, output the line Item does not fit.