#include <cstdio> #include <iostream> #include <algorithm> using namespace std; int n, k; long long a[100010]; int main() { freopen("xor.in", "r", stdin); freopen("xor.out", "w", stdout); cin >> n >> k; for (int i = 1; i <= n; i++) cin >> a[i]; long long s = 0; for (int i = 1; i <= n; i++) s += a[i]; long long ans = 0; for (int i = 1; i <= n; i++) { long long num = s - a[i]; num += a[i] ^ k; ans = max(ans, num); } cout << ans << endl; fclose(stdin); fclose(stdout); return 0; }