#include <bits/stdc++.h>
#define pii pair<ll, ll>
typedef long long ll;
using namespace std;

const ll MAX = 300007, MOD = 998244353;

struct Trie {
	ll cnt;
	Trie* C[2];
	Trie() {
		cnt = 0;
		C[0] = C[1] = nullptr;
	}
	void Update(ll n, ll bit) {
		cnt++;
		if (bit < 0) return;
		int t = (n & (1LL << bit)) > 0;
		if (!C[t]) C[t] = new Trie;
		C[t]->Update(n, bit - 1);
	}
	ll Query(ll n, ll k, ll bit) {
		int a = (n & (1LL << bit)) > 0;
		int b = (k & (1LL << bit)) > 0;

		ll ret = 0;
		if (b && C[a]) ret += C[a]->cnt;
		if (C[a ^ b]) ret += C[a ^ b]->Query(n, k, bit - 1);
		return ret;
	}
} R;

int main() {
	ios::sync_with_stdio(0); cin.tie(0);
	ll N, X;
	cin >> N >> X;

	if (!X) {
		ll t = 1;
		while (N--) t = t * 2 % MOD;
		cout << t - 1;
		return 0;
	}

	ll ans = 1, mask = 1;
	while ((mask & X) != X) mask = mask * 2LL + 1;
	map<ll, vector<ll>> go;
	while (N--) {
		ll n;
		cin >> n;
		ll base = (n | mask) ^ mask;
		go[base].push_back(n & mask);
	}

	for (auto& [_, v] : go) {
		ll ret = 1LL + v.size(), two = 1LL * v.size() * v.size(), temp = 0;
		// pick two, whose xor cnt greater or equal than X

		//for (int i = 0; i < v.size(); ++i) for (int j = i + 1; j < v.size(); ++j) {
		//	if (X <= (v[i] ^ v[j])) temp++;
		//}

		Trie R;
		for (ll n : v) R.Update(n, 59);
		for (ll n : v) two -= R.Query(n, X, 59);
		ret = (ret + two / 2LL) % MOD;

		ans = ans * ret % MOD;
	}

	ans = (ans + MOD - 1) % MOD;
	cout << ans;
	return 0;
}