#include<bits/stdc++.h>
#define int long long
using namespace std;
const long long mod = 998244353;
int n, a[300005], sum[60 * 310005], son[60 * 310005][2], ccnt, m, f[300005], ans;
inline void add(int p, int q, int num, int w) {
	sum[p] += w;
	if (q == 0) return;
	if ((num >> (q - 1)) & 1) {
		if (!son[p][1]) son[p][1] = ++ccnt;
		add(son[p][1], q - 1, num, w);
	} else {
		if (!son[p][0]) son[p][0] = ++ccnt;
		add(son[p][0], q - 1, num, w);
	}
}
inline int calc(int p, int q, int w) {
	if (p == 0) return 0;
	if (q == 0) return sum[p];
	if ((m >> (q - 1)) & 1) {
		if ((w >> (q - 1)) & 1) {
			return calc(son[p][0], q - 1, w);
		} else {
			return calc(son[p][1], q - 1, w);
		}
	} else {
		if ((w >> (q - 1)) & 1) {
			return (sum[son[p][0]] + calc(son[p][1], q - 1, w)) % mod;
		} else {
			return (sum[son[p][1]] + calc(son[p][0], q - 1, w)) % mod;
		}
	}
}
signed main() {
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> n;
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> a[i];
	}
	sort(a + 1, a + n + 1);
	f[1] = 1;
	ccnt = 1;
	ans = 1;
	add(1, 60, a[1], 1);
	for (int i = 2; i <= n; i++) {
		f[i] = (calc(1, 60, a[i]) + 1);
		add(1, 60, a[i], f[i]);
		ans += f[i];
		ans %= mod;
	}
	cout << ans;
}
//发现只用考虑相邻的异或值(证明显然)
//直接用trie维护dp值