House Plates

A country plans to build a programmer city called Oskolkovo. The city will be large. It will have $N$ streets, and each street has $a_i$ houses. The government decided to use an innovation: instead of ordinary house number plates, the plates will show house numbers written in binary.

After the numbering plan was approved, a tender was held for making plates with the digits 0 and 1. The winning company makes a plate with the digit 0 for $a$ rubles and a plate with the digit 1 for $b$ rubles. The government wants to know the cost of making the plates for the houses.

The first line contains a natural number $N$ ($1 \le N \le 100$) and $a$, $b$ ($1 \le a, b \le 100$). $N$ is the number of streets, and $a$ and $b$ are the costs of making the digits 0 and 1.

Each of the next $N$ lines contains a natural number $a_i$ ($1 \le a_i \le 100$), the number of houses on that street. After that, the line contains $a_i$ natural numbers $c_j$ ($1 \le c_j \le 100$), the house numbers on that street that need plates. A house may need more than one plate.

Output one natural number: the cost of making the plates.