#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, x;
  const int Count = 200001;
  unsigned long long a[Count];
  unsigned long long pre[Count];
  unsigned long long nex[Count];
  while (cin >> n >> k >> x) {
    for (int i = 0; i < n; i++) cin >> a[i];
    int all = 0;
    for (int i = 0; i < n; i++) all = a[i] | all;
    unsigned long long max = a[0];
    int maxid = 0;
    pre[0] = 0;
    for (int i = 1; i < n; i++) {
      pre[i] = pre[i - 1] | a[i - 1];
      if (a[i] > max) {
        max = a[i];
        maxid = i;
      }
    }
    nex[n - 1] = 0;
    for (int i = n - 2; i >= 0; i--) nex[i] = nex[i + 1] | a[i + 1];
    unsigned long long xpowk = 1;
    for (int i = 0; i < k; i++) xpowk *= x;
    for (int i = 0; i < n; i++) {
      if ((pre[i] | nex[i] | (a[i] * xpowk)) > max)
        max = (pre[i] | nex[i] | (a[i] * xpowk));
    }
    cout << max << endl;
  }
  return 0;
}

### Prompt

Create a solution in Cpp for the following problem:

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.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, k, x;
  const int Count = 200001;
  unsigned long long a[Count];
  unsigned long long pre[Count];
  unsigned long long nex[Count];
  while (cin >> n >> k >> x) {
    for (int i = 0; i < n; i++) cin >> a[i];
    int all = 0;
    for (int i = 0; i < n; i++) all = a[i] | all;
    unsigned long long max = a[0];
    int maxid = 0;
    pre[0] = 0;
    for (int i = 1; i < n; i++) {
      pre[i] = pre[i - 1] | a[i - 1];
      if (a[i] > max) {
        max = a[i];
        maxid = i;
      }
    }
    nex[n - 1] = 0;
    for (int i = n - 2; i >= 0; i--) nex[i] = nex[i + 1] | a[i + 1];
    unsigned long long xpowk = 1;
    for (int i = 0; i < k; i++) xpowk *= x;
    for (int i = 0; i < n; i++) {
      if ((pre[i] | nex[i] | (a[i] * xpowk)) > max)
        max = (pre[i] | nex[i] | (a[i] * xpowk));
    }
    cout << max << endl;
  }
  return 0;
}

```