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.
//package CodeForces;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.Arrays;
import java.util.Scanner;

public class OrGame {
	
	static void solve(long arr[],long k,long m)
	{
		if(arr.length==1)
		{
			System.out.println(arr[0]*(long)Math.pow(m,k));
			return ;
		}
		long left[]=new long[arr.length];
		long right[]=new long[arr.length];
		long temp=0;
		for(int i=0;i<arr.length;i++)
		{
			temp=temp|arr[i];
			left[i]=temp;
		}
		temp=0;
		for(int i=arr.length-1;i>=0;i--)
		{
			temp=temp|arr[i];
			right[i]=temp;
		}
		long ans=0;
		for(int i=0;i<arr.length;i++)
		{
			if(i==0)
			{
				ans=Math.max(ans,(arr[i]*(long)Math.pow(m,k))|right[i+1]);
			}
			else if(i==arr.length-1)
			{
				ans=Math.max(ans,(arr[i]*(long)Math.pow(m,k))|left[i-1]);
			}
			else
			{
				ans=Math.max(ans,left[i-1]|(arr[i]*(long)Math.pow(m,k))|right[i+1]);
			}
		}
		System.out.println(ans);
	}
	
	public static void main(String[] args) throws IOException{
		// TODO Auto-generated method stub
		BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		String temp[]=br.readLine().trim().split(" ");
		int n=Integer.parseInt(temp[0]);
		long k=Long.parseLong(temp[1]);
		long m=Long.parseLong(temp[2]);
		long arr[]=new long[n];
		String str[]=br.readLine().trim().split(" ");
		for(int i=0;i<n;i++)
		{
			arr[i]=Long.parseLong(str[i]);
		}
		solve(arr,k,m);
		

	}

}
