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>).
def solve(n,k,x,a):
    s = 0
    prefix = [0] * n
    suffix = [0] * (n+1)
    m = pow(x,k)
    for i in range(n):
        prefix[i] = prefix[i-1] | a[i]
    for i in range(n-1, -1, -1):
        suffix[i] = suffix[i+1] | a[i]
    for i in range(1,n):
        s = max(s, prefix[i-1] | (a[i]*m) | suffix[i+1])
    return s

def main(infile, outfile):
    n,k,x = map(int,infile.readline().split())
    a = list(map(int,infile.readline().split()))
    outfile.write(str(solve(n,k,x,a)) + '\n')

if __name__ == '__main__':
    from sys import stdin, stdout
    main(stdin, stdout)

