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.
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Fri Jun 14 21:25:50 2019

@author: pawangoyal
"""
input_1=input()
input_1=input_1.split()
n = int(input_1[0])
k = int(input_1[1])
x = int(input_1[2])

a=input()
a=a.split()
a=[int(x) for x in a]
maximum=0
prefix=[]
suffix=[]

prefix_or = 0
suffix_or = 0

for i in range(n):
    prefix_or = prefix_or|a[i]
    prefix.append(prefix_or)

for i in range(n-1,-1,-1):
    suffix_or = suffix_or|a[i]
    suffix.append(suffix_or)
 
or_bit=0

if n ==1 :
    or_bit=a[0]*(x**k)
else:
    for i in range(n):
        if i == 0:
            or_bit=max(or_bit,(a[0]*(x**k)|suffix[n-2]))
        elif i == (n-1):
            or_bit=max(or_bit,(a[n-1]*(x**k)|prefix[n-2]))
        else:
            or_bit=max(or_bit,(a[i]*(x**k)|prefix[i-1]|suffix[n-2-i]))
   
    
print(or_bit)

