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.
#!/bin/sh
# -*- coding: utf-8 -*-
''''which python2 >/dev/null && exec python2 "$0" "$@" # '''
''''which python  >/dev/null && exec python  "$0" "$@" # '''



n, k, x = map(int, raw_input().split())

arr = map(int, raw_input().split())

orsum1 = [0] * (len(arr)+2)
orsum2 = [0] * (len(arr)+2)


for i in xrange(len(arr)):
    orsum1[i+1] = orsum1[i] | arr[i]

for i in xrange(len(arr)-1, -1, -1):
    orsum2[i+1] = orsum2[i+2] | arr[i]

ans = 0

for i in xrange(1, len(arr)+1):
    tmp = orsum1[i-1] | orsum2[i+1] | (arr[i-1]*x**k)
    ans = max(tmp, ans)

print ans