Split and Merge

A $1 \times L$ board is divided into $1 \times 1$ pieces and $1 \times 2$ pieces.

You can perform two kinds of operations. One splits a single $1 \times 2$ piece into two $1 \times 1$ pieces. The other merges two adjacent $1 \times 1$ pieces into a single $1 \times 2$ piece.

Given the initial state and the target state of the board, find the minimum number of operations and the number of ways to change the state with that many operations.

The first line gives the board length $L$ ($1 \le L \le 3000$).

The second line gives the number of pieces $n$ in the initial state ($1 \le n \le L$).

The third line gives $n$ numbers $a_1, a_2, ..., a_n$. They list each piece length from the leftmost piece, and each number is 1 or 2. The $n$ numbers sum to $L$.

The fourth line gives the number of pieces $m$ in the target state ($1 \le m \le L$).

The fifth line gives $m$ numbers $b_1, b_2, ..., b_m$ in the same format as the third line.

Print the minimum number of operations and the number of ways, separated by a space. Since the number of ways can be large, print it modulo $1000000007$.