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.
if __name__=="__main__":

    n,k,x=map(int,raw_input().split())
    mx=0
    mor=0
    lst=map(int,raw_input().split())

    pre=[p for p in lst]
    suf=[p for p in lst]

    for i in range(1,len(lst)):
        pre[i]=pre[i-1]|pre[i]
        suf[len(lst)-i-1]=suf[len(lst)-i]|suf[len(lst)-i-1]

    if len(lst)==1:
        print lst[0]*(x**k)
        exit(0)
    
    mx=0
    for i in range(len(lst)):
        if i==0:
            tmp=max(mx, (lst[i]*(x**k))|suf[i+1])
        elif i==len(lst)-1:
            tmp=max(mx, (lst[i]*(x**k))|pre[i-1])
        else:
            tmp=max(mx, (lst[i]*(x**k))|pre[i-1]|suf[i+1])

        mx=max(mx,tmp)
    # print
    print mx