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.
# -*- coding:utf-8 -*-

"""

created by shuangquan.huang at 1/10/20

"""

import collections
import time
import os
import sys
import bisect
import heapq
from typing import List
import itertools


def blen(val):
    s = 0
    while val > 0:
        s += 1
        val >>= 1
    
    return s


def solve(N, K, X, A):
    left = [0 for _ in range(N)]
    right = [0 for _ in range(N)]
    
    for i, v in enumerate(A):
        left[i] = (left[i-1] if i-1 >= 0 else 0) | v
    for i in range(N-1, -1, -1):
        right[i] = (right[i+1] if i+1 < N else 0) | A[i]
    
    ans = 0
    for i, v in enumerate(A):
        a = left[i-1] if i-1 >= 0 else 0
        b = right[i+1] if i+1 < N else 0
        ans = max(ans, a | b | (v * X**K))
    
    return ans
    
    

N, K, X = map(int, input().split())
A = [int(x) for x in input().split()]
print(solve(N, K, X, A))