That's One Hanoi-ed Teacher

Roberta teaches math at a small college, and she has just introduced the Tower of Hanoi to her discrete math class. The puzzle has three pegs and $n$ disks with radii $1, 2, \ldots, n$. At the start every disk sits on the start peg, ordered by increasing size from top to bottom. The object is to move all of them to the destination peg under two rules:

1. You move only one disk at a time.
2. At no point may a larger disk lie on top of a smaller disk.

The optimal solution for $n$ disks takes $2^n - 1$ moves, so it passes through exactly $2^n$ configurations, counting the start and the goal. The picture below shows the optimal solution for $n = 3$, with the start peg on the left and the destination peg on the right.

While the students work, Roberta wants to look at a layout and decide whether it is one of those $2^n$ configurations. If it is, she also wants to tell the student how many moves are left to the goal, which is every disk stacked on the destination peg in decreasing size from bottom to top. Write the program she asks for.

Input consists of three lines, each line representing one peg. Each line starts with a non-negative integer $m$, the number of disks on that peg, followed by $m$ integers listing those disks from the bottom of the peg upward. The first line is the start peg and the third line is the destination peg. Disk numbers are the consecutive integers $1$ to $n$, where the number is the radius of the disk, and $1 \le n \le 50$. The given layout is a legal configuration of the puzzle: on every peg the radii strictly decrease from bottom to top.

Print No if the given configuration is not in the optimal solution sequence. Otherwise print the minimum number of moves still required to reach the goal configuration.