Array Game

A one player game runs on a one dimensional array that stretches without end in both directions. Each cell holds an integer, a + sign, a - sign, or nothing at all. On every turn the player shifts all of the integers that are still in the array one cell to the left or one cell to the right. The signs never move.

The score starts at 0. When an integer $I$ lands on a cell that holds a sign $S$, that integer leaves the array and the score grows by $S \times I$, where + counts as $+1$ and - counts as $-1$.

The player may stop the game at any moment.

The picture below shows the starting array and the two arrays that follow it after two moves to the right.

Given the starting array, find the largest score the player can reach.

The input holds several test cases. The first line of a test case gives $N$ ($1 \le N \le 100$), the number of integers, then $N_p$ ($1 \le N_p \le 100$), the number of + signs, then $N_m$ ($1 \le N_m \le 100$), the number of - signs. Each of the next $N$ lines gives two integers $p_i$ ($-300 \le p_i \le 300$), the position, and $v_i$ ($-9 \le v_i \le 9$), the value of the $i$-th integer. The next line gives the positions of the $N_p$ + signs, and the line after it gives the positions of the $N_m$ - signs. Every position lies between $-300$ and $300$, and no two elements, integers and signs alike, start on the same position. A line holding 0 0 0 ends the input.

For each test case print one line with the largest score the player can reach.