##### Canadian Computing Competition: 2011 Stage 2, Day 2, Problem 2

You are playing a game with a stack of disks (). The goal of the game is remove all of the disks from your stack. However, there is a cost associated with removing disks, and you wish to minimize the cost of removing all the disks from your stack.

Each disk contains a label, with the label being in the range .

You are also given a "Master stack" of disks which you can use to help you remove disks from your stack.

You can remove disks from the top of your stack of disks in two ways:

remove a disk at the top of your stack: if label of the disk on top of your stack is , that disk can be removed from your stack with cost ;

remove a disk from both the top of the Master stack and the top of your stack if the label is the same between both disks: in this case, there is no cost with removing both disks.

You are also allowed to modify the order of the top () elements of your stack, so long as immediately after each modification, you remove the top element of your stack. There are three allowed modifications:

Reverse: you may reverse the order of the top () disks on your stack. In other words, if the top disks are (reading from the top down), then after this operation, the top disks will be (reading from the top down). The cost of one reverse operation is ().

(Cyclic Shift) Up: you can shift up one disk in the range of the top disks (). For example, if the top four disks are (read from the top down), you can perform an up shift in the range of the top three elements to get or an up shift of the top four elements to get . The cost of one up shift operation is ().

(Cyclic Shift) Down: you can shift down one disk in the range of the top disks (). For example, if the top four disks are (read from the top down), you can perform a down shift in the range of the top three elements to get or a down shift of the top four elements to get . The cost of one down shift operation is ().

If the operations yield a match between the top of the master stack and the top of your stack, you can pop for free. If not, you must pay the cost of the pop.

There is one additional constraint. At any point in the game, if a disk at level is being popped (levels start at 0 at the bottom of the stack), then all elements that were *originally* at level or higher must have already been popped, where .

Minimize the cost required to pop all the elements off of your stack.

#### Input Specification

The first line will contain 6 space-separated integers: where:

- is the number of disks in each of the stacks ()
- , the maximum depth at which operations can be done ()
- , the threshold before which elements can be removed from our stack, ()
- , the cost for a shift in which the bottom element of the selected range goes to the top ()
- , the cost for an up shift operation (in which the top element of the selected range goes to the bottom), ()
- , the cost for reversing the top elements of the selected range ()

lines will follow, each containing a number (). The first lines will contain the labels of the disks in the Master stack, from top to bottom. The next lines will contain the labels of the disks in your stack, from top to bottom.

Note: For 20% of the marks for this question, you may assume that .

#### Output Specification

Output the integer (on one line) which is the minimal cost required to remove all disks from your stack.

#### Sample Input

```
7 3 3 4 4 3
5
6
3
5
4
1
2
3
5
6
5
1
4
1
```

#### Sample Output

`5`

#### Explanation for Sample Output

We take 3 to the bottom and shift the two blocks below it up, with cost 4. Then we remove four blocks from each stack, remove a 1 from the playing stack, with cost 1, and remove two blocks from each stack.

## Comments

Mistakenly reading "if a disk at level 𝑗 is being popped" as "if a disk

originallyat level 𝑗 is being popped" earns 11/15 of the test cases.