#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/contests/maang/problems/0D

░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░░██████████████████████████████████████████████

#####   ######  #####    ###    #   #  ###  #   #  ######
##  ##  ##      ##  ##  ## ##   #   #   #   #   #  ##
#####   ####    #####   #   #   #   #   #   #   #  ####
##  #   ##      ##      ## ##    # #    #    # #   ##
##   #  ######  ##       ###      #    ###    #    ######

$ curl repovive.com/contests/maang/problems/0D

Repovive

Divider Removal Area - MAANG Problems | Repovive | Repovive

Back

Code

Upload

Submissions

Learn

MAANG0D. Divider Removal Area

100 ptstype :zen to enter zen mode

Time: 2sMemory: 256 MB

A storage unit has dimensions $(H{+}1) \times (W{+}1)$ , divided into a grid by $H$ horizontal dividers at rows $1$ through $H$ and $W$ vertical dividers at columns $1$ through $W$ . Some of these dividers are removed, merging adjacent compartments.

Given the indices of horizontal and vertical dividers to remove, find the area of the largest resulting compartment.

Constraints

$1 \le H, W \le 10^6$
$0 \le |\text{horizontalCuts}| \le H$
$0 \le |\text{verticalCuts}| \le W$
All cut indices are distinct and in the range $[1, H]$ or $[1, W]$ respectively

Input

\begin{array}{l} H \quad W \\ n_h \quad h_1 \quad h_2 \quad \cdots \quad h_{n_h} \\ n_v \quad v_1 \quad v_2 \quad \cdots \quad v_{n_v} \end{array}

Output

$ans$

Samples

Input

3 3
2 2 3
1 2

Explanation

The storage unit is a $4 \times 4$ grid (rows 0-3, columns 0-3) with 3 horizontal dividers and 3 vertical dividers. Removing horizontal dividers 2 and 3 merges rows 1, 2, 3 into one vertical span of size 3. Removing vertical divider 2 merges columns 1 and 2 into a horizontal span of size 2. The largest compartment is $3 \times 2 =$ 6.

Output

Input

2 2
2 1 2
2 1 2

Explanation

The grid is $3 \times 3$ . Removing all horizontal dividers merges all 3 rows (span 3). Removing all vertical dividers merges all 3 columns (span 3). The entire storage becomes one compartment of area $3 \times 3 =$ 9.

Output

Input

2 3
0
0

Explanation

No dividers are removed. Every cell is its own compartment of size $1 \times 1 = 1$ . The largest compartment has area 1.

Output

Given the indices of horizontal and vertical dividers to remove, find the area of the largest resulting compartment.

Constraints

$1 \le H, W \le 10^6$
$0 \le |\text{horizontalCuts}| \le H$
$0 \le |\text{verticalCuts}| \le W$
All cut indices are distinct and in the range $[1, H]$ or $[1, W]$ respectively

\begin{array}{l} H \quad W \\ n_h \quad h_1 \quad h_2 \quad \cdots \quad h_{n_h} \\ n_v \quad v_1 \quad v_2 \quad \cdots \quad v_{n_v} \end{array}

$ans$

No dividers are removed. Every cell is its own compartment of size $1 \times 1 = 1$ . The largest compartment has area 1.