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.
import java.util.ArrayList;
import java.util.Collections;
import java.util.List;
import java.util.Scanner;
/**
 *
 * @author admin
 */
public class OrGame {

    /**
     * @param args the command line arguments
     */
    public static void main(String[] args) {
        // TODO code application logic here
        Scanner c = new Scanner(System.in);
        
        long n = c.nextInt();
        long k = c.nextLong();
        long x = c.nextLong();
        c.nextLine();
        
        List<Long> list = new ArrayList<>();
        for (long i = 0; i < n; i++) {
            list.add(c.nextLong());
        }
        //Collections.sort(list, Collections.reverseOrder());
        long res = orList(list, k, x);
        System.out.println(res);
    }
    
    public static long orList(List<Long> list, long k, long x){
        int iMax = 0;
        int [] onesList = buildOnesList(list);
        long max = getOr(onesList);
        
        for (int i = 0; i < list.size(); i++) {
            long newOr = getOr(onesList,list.get(i),(long)Math.pow(x, k));
            if (newOr > max) {
                max = newOr;
                iMax = i;
            }                
        }
        //onesList = updateOnesList(onesList,list.get(iMax),x);
        //list.set(iMax,list.get(iMax) * x);
                        
        return max;
    }    
    
    public static int[] buildOnesList(List<Long> list){
        int [] res = new int[64];
        
        for (long l : list) {
            long temp = l;
            int i = 0;
            do{
                if ((temp & 1) == 1) {
                    res[i]++;
                }
                temp = temp >> 1;
                i++;
            }while(temp>0);
        }
        
        return res;
    }
    
    public static long getOr(int [] onesList){
        long res = 0;
        for (int i = onesList.length-1; i >= 0; i--) {
            res = res << 1;
            if (onesList[i] > 0) {
                res = res | 1;
            }            
        }
        return res;
    }
    
    public static long getOr(int [] onesList, long value, long x){
        int [] newOnesList = updateOnesList(onesList,value,x);
        return getOr(newOnesList);
        
    }
    
    public static int[] updateOnesList(int [] onesList, long value, long x){
        int [] res = new int[onesList.length];
        System.arraycopy(onesList, 0, res , 0,onesList.length);
        long newValue = value * x;
        int i = 0;
        do{
            if ((newValue & 1) == 1 && (value & 1) == 0) {
                //the last bit is one
                res[i]++;                             
            }else if( (newValue & 1)==0 && (value & 1) == 1){
                res[i]--;
            }
            newValue = newValue >> 1;
            value = value >> 1;
            i++;
        }while(newValue > 0);
        
        return res;    
    }
}