Codeforces Round 122 (Div. 2)
D
Xor
Codeforces
未评级
原题
← CE →
翻译中…

John Doe has four arrays: $*a*$, $*b*$, $*k*$, and $*p*$. Each array consists of $*n*$ integers. Elements of all arrays are indexed starting from $1$. Array $*p*$ is a permutation of integers $1$ to $*n*$.

翻译中…

John invented a game for his friends and himself. Initially a player is given array $*a*$. The player must consecutively execute exactly $*u*$ operations on $*a*$. You are permitted to execute the following operations:

翻译中…
  • Operation 1: For each image change $*a*_{*i*}$ into image. Expression image means applying the operation of a bitwise xor to numbers $*x*$ and $*y*$. The given operation exists in all modern programming languages, for example, in language C++ and Java it is marked as "^", in Pascal — as "xor".
  • Operation 2: For each image change $*a*_{*i*}$ into $*a*_{*p*_{*i*}} + *r*$. When this operation is executed, all changes are made at the same time.
翻译中…

After all $*u*$ operations are applied, the number of points the player gets is determined by the formula image.

翻译中…

John wants to find out what maximum number of points a player can win in his game. Help him.

翻译中…

Input

翻译中…

The first line contains space-separated integers $*n*$, $*u*$ and $*r*$ ($1 ≤ *n*, *u* ≤ 30$, $0 ≤ *r* ≤ 100$) — the number of elements in each array, the number of operations and the number that describes one of the operations.

翻译中…

Each of the next four lines contains $*n*$ space-separated integers — arrays $*a*$, $*b*$, $*k*$, $*p*$. The first line has array $*a*$, the second line has array $*b*$, the third line has array $*k*$ and the fourth one has array $*p*$.

翻译中…

It is guaranteed that elements of arrays $*a*$ and $*b*$ are positive and do not exceed $10^{4}$ $(1 ≤ *a*_{*i*}, *b*_{*i*} ≤ 10^{4})$, elements of array $*k*$ do not exceed $10^{4}$ in the absolute value $(|*k*| ≤ 10^{4})$ and $*p*$ is a permutation of numbers from $1$ to $*n*$.

翻译中…

Output

翻译中…

On a single line print number $*s*$ — the maximum number of points that a player can win in John's game.

翻译中…

Please, do not use the %lld specifier to read or write 64-bit integers in С++. It is preferred to use the cin, cout streams or the %I64d specifier.

翻译中…

Note

翻译中…

In the first sample you should first apply the operation of the first type, then the operation of the second type.

翻译中…

样例

Input #1
3 2 1
7 7 7
8 8 8
1 2 3
1 3 2
Output #1
96
InputCopy OutputCopy
Input #2
2 1 0
1 1
1 1
1 -1
1 2
Output #2
0
InputCopy OutputCopy
题目信息
题号
194D
时间限制
4 s
内存限制
256 MB

题面与样例版权归 Codeforces 及出题人所有;中文翻译由 AI 生成(CI 管线),如有出入请以原文为准。