#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#define _GLIBCXX_DEBUG
using namespace std;
using std::cout;
using std::cin;
using std::endl;
using ll=long long;
using ld=long double;
ll ILL=2167167167167167167;
const int INF=2100000000;
const ll mod=998244353;
#define rep(i,a) for (ll i=0;i<a;i++)
#define all(p) p.begin(),p.end()
template<class T> using _pq = priority_queue<T, vector<T>, greater<T>>;
template<class T> ll LB(vector<T> &v,T a){return lower_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> ll UB(vector<T> &v,T a){return upper_bound(v.begin(),v.end(),a)-v.begin();}
template<class T> bool chmin(T &a,const T &b){if(a>b){a=b;return 1;}else return 0;}
template<class T> bool chmax(T &a,const T &b){if(a<b){a=b;return 1;}else return 0;}
template<class T> void So(vector<T> &v) {sort(v.begin(),v.end());}
template<class T> void Sore(vector<T> &v) {sort(v.begin(),v.end(),[](T x,T y){return x>y;});}
void yneos(bool a){if(a) cout<<"Yes\n"; else cout<<"No\n";}
template<class T> void vec_out(vector<T> &p){for(int i=0;i<(int)(p.size());i++){if(i) cout<<" ";cout<<p[i];}cout<<"\n";}


void solve();
// oddloop
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	
	int t=1;
	//cin>>t;
	rep(i,t) solve();
}

void solve(){
	int L=(1<<10);
	int N,K;
	cin>>N>>K;
	vector<ll> C(L);
	rep(i,N){
		int a;
		cin>>a;
		C[a]++;
	}
	chmin(K,11);
	vector<vector<ll>> dp(K+1,vector<ll>(L,0));
	dp[0][0]=1;
	rep(i,L){
		if(i==0) continue;
		for(int j=((L-1)^i);j>=0;j--){
			j&=((L-1)^i);
			rep(roop,K){
				dp[roop+1][j^i]=(dp[roop+1][j^i]+C[i]*dp[roop][j])%mod;
			}
		}
	}
	ll ans=0;
	rep(i,L){
		ans=(ans+dp[K][i])%mod;
	}
	cout<<ans<<"\n";
}