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.
n,k,x=map(int,raw_input().split())
x=x**k
u=[0]+map(int,raw_input().split())
orLeft=[0]
for i in xrange(1,n+1):
    orLeft.append(orLeft[-1]|u[i])
orRight=[0]
for i in xrange(n,0,-1):
    orRight.append(orRight[-1]|u[i])
orRight.reverse()
orRight.insert(0,0)
ans=0
for i in xrange(1,n+1):
    ans=max(ans,orLeft[i-1]|orRight[i+1]|(u[i]*x))
print ans
