#pragma GCC optimize ("O2")
#pragma GCC target ("avx2")
#include<bits/stdc++.h>

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please

const int mod = 998244353;

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N, K;
	cin >> N >> K;
	int A[200000];
	rep(i, N) cin >> A[i];

	ll dp[1024][10] = {};
	dp[0][0] = 1;
	rep(i, N) {
		for (int j = 1023; j >= 0; j--) {
			if (A[i] + j != (A[i] ^ j)) continue;
			rep(k, 10) {
				(dp[j + A[i]][k + 1] += dp[j][k]) % mod;
			}
		}
	}
	ll kotae = 0;
	rep(j, 1024) {
		kotae += dp[j][K];
	}
	co(kotae% mod);

	Would you please return 0;
}