C. Chocolate Packing
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

In preparation for Mother's Day, you are tasked with packing chocolate boxes into a larger shipping box for delivery. Each chocolate box is a small rectangular box, and you need to determine the maximum number of these chocolate boxes that can be packed into the shipping box. The chocolate boxes, just like your love for your mom, come in identical shapes, and they need to be packed efficiently into the shipping box, which is also a rectangular box.

However, there's a catch! To maintain the aesthetic appeal of the gift, the chocolate boxes must all be packed in the same orientation, with their sides parallel to the sides of the shipping box. Also, the chocolate boxes cannot be broken or resized to fit into the shipping box.

Your task is to write a program that calculates the maximum number of chocolate boxes that can be packed inside the shipping box.

Input

The first line contains three integers L, W, and H, representing the dimensions of the shipping box ($$$1 \leq L, W, H \leq 1000$$$). The second line contains three integers l, w, and h, representing the dimensions of a chocolate box ($$$1 \leq l, w, h \leq 1000$$$).

Output

Output a line with a single integer representing the maximum number of chocolate boxes that can be packed inside the shipping box.

Examples
Input
1 1 1
3 3 3
Output
0
Input
6 5 4
3 2 1
Output
20
Input
21 11 31
10 3 2
Output
105