You are given n numbers a 1, a 2, ..., a n . You can perform at most k operations. For each operation you can multiply one of the numbers by x . We want to make as large as possible, where denotes the bitwise OR. Find the maximum possible value of after performing at most k operations optimally.
输入描述:
The first line contains three integers n, k and x (1 ≤ n ≤ 200 000, 1 ≤ k ≤ 10, 2 ≤ x ≤ 8).The second line contains n integers a1, a2, ..., an (0 ≤ ai ≤ 109).
输出描述:
Output the maximum value of a bitwise OR of sequence elements after performing operations.
示例1
输入
3 1 2<br />1 1 1<br />4 2 3<br />1 2 4 8<br />
备注:
For the first sample, any possible choice of doing one operation will result the same three numbers 1, 1, 2 so the result is . For the second sample if we multiply 8 by 3 two times we'll get 72. In this case the numbers will become 1, 2, 4, 72 so the OR value will be 79 and is the largest possible result.
加载中...