You are given *n* numbers *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub>. You can perform at most *k* operations. For each operation you can multiply one of the numbers by *x*. We want to make <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/1faa5be276f646dfb07d2a01bf67449ad72c0ef7.png" style="max-width: 100.0%;max-height: 100.0%;"/> as large as possible, where <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/ddbf6923ea3f08cb83b08ed026f40a80751dff3f.png" style="max-width: 100.0%;max-height: 100.0%;"/> denotes the bitwise OR. 

Find the maximum possible value of <img align="middle" class="tex-formula" src="https://espresso.codeforces.com/1faa5be276f646dfb07d2a01bf67449ad72c0ef7.png" style="max-width: 100.0%;max-height: 100.0%;"/> 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 *a*<sub class="lower-index">1</sub>, *a*<sub class="lower-index">2</sub>, ..., *a*<sub class="lower-index">*n*</sub> (0 ≤ *a*<sub class="lower-index">*i*</sub> ≤ 10<sup class="upper-index">9</sup>).
import math
a=list(map(int,input().split()))
n=a[0]
k=a[1]
x=a[2]
a=list(map(int,input().split()))
b=[None]*n
c=[None]*n
b[0]=a[0]
mul=1
c[n-1]=a[n-1]
for i in range(k):
    mul*=x
if n==1:
    print(mul*a[0])
else:
    for i in range(1,n):
        b[i]=b[i-1]|a[i]
    for i in range(n-2,-1,-1):
        c[i]=c[i+1]|a[i]
    ans=max(a[0]*mul|c[1],a[n-1]*mul|b[n-2])
    for i in range(1,n-1):
        ans=max(ans,a[i]*mul|b[i-1]|c[i+1])
    print(ans)
