#include #define rep(i,n) for(int i=0;i<(n);i++) using namespace std; class mint{ static const int MOD=998244353; int x; public: mint():x(0){} mint(long long y){ x=y%MOD; if(x<0) x+=MOD; } mint& operator+=(const mint& m){ x+=m.x; if(x>=MOD) x-=MOD; return *this; } mint& operator-=(const mint& m){ x-=m.x; if(x< 0) x+=MOD; return *this; } mint& operator*=(const mint& m){ x=1LL*x*m.x%MOD; return *this; } mint& operator/=(const mint& m){ return *this*=inverse(m); } mint operator+(const mint& m)const{ return mint(*this)+=m; } mint operator-(const mint& m)const{ return mint(*this)-=m; } mint operator*(const mint& m)const{ return mint(*this)*=m; } mint operator/(const mint& m)const{ return mint(*this)/=m; } mint operator-()const{ return mint(-x); } friend mint inverse(const mint& m){ int a=m.x,b=MOD,u=1,v=0; while(b>0){ int t=a/b; a-=t*b; swap(a,b); u-=t*v; swap(u,v); } return u; } friend istream& operator>>(istream& is,mint& m){ long long t; is>>t; m=mint(t); return is; } friend ostream& operator<<(ostream& os,const mint& m){ return os< memo={1}; if(memo.size()<=n){ int k=memo.size(); memo.resize(n+1); for(;k<=n;k++) memo[k]=memo[k-1]*k; } return memo[n]; } int main(){ int n,k; scanf("%d%d",&n,&k); vector a(n); rep(i,n) scanf("%d",&a[i]); if(k>10){ puts("0"); return 0; } int hist[1024]={}; rep(i,n) hist[a[i]]++; mint dp[11][1024]; dp[0][0]=1; rep(i,k) rep(x,1024) { rep(y,1024) if((x&y)==0) { dp[i+1][x|y]+=dp[i][x]*hist[y]; } } mint ans=0; rep(x,1024) ans+=dp[k][x]; cout<