You are given n numbers a1, a2, ..., an. You can perform at most k operations. For each operation you can multiply one of the numbers by x. We want to make <image> as large as possible, where <image> denotes the bitwise OR. 

Find the maximum possible value of <image> after performing at most k operations optimally.

Input

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

Output the maximum value of a bitwise OR of sequence elements after performing operations.

Examples

Input

3 1 2
1 1 1


Output

3


Input

4 2 3
1 2 4 8


Output

79

Note

For the first sample, any possible choice of doing one operation will result the same three numbers 1, 1, 2 so the result is <image>. 

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.
__author__ = 'trunghieu11'


def solve(n, k, x, A):
    if n == 1:
        return A[0] * x**k

    prefix = [0 for i in range(n)]
    suffix = [0 for i in range(n)]
    prefix[0] = A[0]
    suffix[n - 1] = A[n - 1]
    for i in range(1, n):
        prefix[i] = prefix[i - 1] | A[i]
    for i in range(n - 2, -1, -1):
        suffix[i] = suffix[i + 1] | A[i]
    answer = max((A[0] * x**k) | suffix[1], (A[n - 1] * x**k) | prefix[n - 2])
    for i in range(1, n - 1):
        answer = max(answer, prefix[i - 1] | (A[i] * x**k) | suffix[i + 1])
    return answer


if __name__ == '__main__':
    n, k, x = map(int, raw_input().split(" "))
    A = map(int, raw_input().split(" "))
    print solve(n, k, x, A)