#include <bits/stdc++.h>
using namespace std;
#define modulo 998244353
#define mod(mod_x) ((((long long)mod_x+modulo))%modulo)
#define Inf 2000000005

int main(){
	
	int N,K;
	cin>>N>>K;
	
	vector<int> c(1024,0);
	for(int i=0;i<N;i++){
		int t;
		cin>>t;
		c[t]++;
	}
	
	if(K>11){
		cout<<0<<endl;
		return 0;
	}
	
	vector dp(1025,vector(1024,vector<int>(K+1,0)));
	dp[0][0][0] = 1;
	
	for(int i=0;i<1024;i++){
		for(int j=0;j<1024;j++){
			for(int k=0;k<=K;k++){
				if(dp[i][j][k]==0)continue;
				dp[i+1][j][k] = mod(dp[i][j][k]+dp[i+1][j][k]);
				if(k==K)continue;
				if(j&i)continue;
				dp[i+1][j^i][k+1] = mod(dp[i+1][j^i][k+1] + mod(dp[i][j][k]*c[i]));
				
			}
		}
	}
	
	int ans = 0;
	for(int i=0;i<1024;i++){
		ans = mod(ans + dp.back()[i][K]);
	}
	
	cout<<ans<<endl;
	
	return 0;
}