Problem Statement

You are a bamboo craftsman. You cut bamboo to meet your customers' requests.

You currently have 2 bamboos of integer length.
You also have bamboo length requests from multiple customers. Each customer requests one bamboo of integer length.

You will cut the 2 bamboos into pieces to meet the customers' requests, but you do not know whether you can satisfy everyone.
So you have decided to cut the bamboos so that you can provide bamboo to as many customers as possible.

Given the lengths of the bamboos and the list of customers' requests, write a program that computes the maximum number of customers to whom you can provide bamboo.

Input

$d$
$n_{1_1}$ $n_{2_1}$
$m_1$
$A_{1_1}$ $\dots$ $A_{m1_1}$
$\dots$
$n_{1_d}$ $n_{2_d}$
$m_d$
$A_{1_d}$ $\dots$ $A_{md_d}$

The input consists of multiple datasets.

In one dataset, the lengths of the 2 bamboos

$n_1$ $n_2$ are given on one line. $1 \le n_1 , n_2 \le 100000$

On the next line, the number of customers ｍ is given on one line. $1\le m \le 60$

On the line after that, the bamboo length $a_i$ requested by each customer is given, separated by spaces. $1 \le a_i \le 100000$

Output

$u_1$
$\dots$
$u_d$

Sample

4
15 13
6
4 5 7 9 3 7
10 20
6
5 8 9 6 5 7
20 20
9
5 4 4 4 7 6 11 5 4
3 3
3
7 8 4

5
4
8
0

2
10 14
5
4 3 2 7 8
10 10
3
7 7 5

5
2