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.io.*;
import java.math.BigInteger;
import java.util.*;


public class B {

    void solve() throws IOException {
        int n=nextInt();
        int k=nextInt();
        int x=nextInt();
        long[] a=new long[n];
        for(int i=0;i<n;i++)
            a[i]=nextInt();
        int[] st=new int[32];
        for(int i=0;i<n;i++){
            int bit=1;
            for(int j=0;j<32;j++){
                if((a[i]&bit)!=0)st[j]++;
                bit<<=1;
            }
        }
        long mn=1;
        for(int i=0;i<k;i++)mn*=x;
        long result=0;
        for(int i=0;i<n;i++){
            long ans=0;
            int bit=1;
            for(int j=0;j<32;j++){
                if((a[i]&bit)!=0)st[j]--;
                if(st[j]!=0)ans|=bit;
                bit<<=1;
            }
            long cur=a[i]*mn;
            ans|=cur;
            result=Math.max(result, ans);
            bit=1;
            for(int j=0;j<32;j++){
                if((a[i]&bit)!=0)st[j]++;
                if(st[j]!=0)ans|=bit;
                bit<<=1;
            }
        }
        out.println(result);
    }

    public static void main(String[] args) throws IOException {
        new B().run();
    }

    void run() throws IOException {
        reader = new BufferedReader(new InputStreamReader(System.in));
//      reader = new BufferedReader(new FileReader("input.txt"));
        tokenizer = null;
        out = new PrintWriter(new OutputStreamWriter(System.out));
//      out = new PrintWriter(new FileWriter("output.txt"));
        solve();
        reader.close();
        out.flush();

    }

    BufferedReader reader;
    StringTokenizer tokenizer;
    PrintWriter out;

    int nextInt() throws IOException {
        return Integer.parseInt(nextToken());
    }

    long nextLong() throws IOException {
        return Long.parseLong(nextToken());
    }

    double nextDouble() throws IOException {
        return Double.parseDouble(nextToken());
    }

    String nextToken() throws IOException {
        while (tokenizer == null || !tokenizer.hasMoreTokens()) {
            tokenizer = new StringTokenizer(reader.readLine());
        }
        return tokenizer.nextToken();
    }
}
