#include<bits/stdc++.h>
using namespace std;
#define int long long
#define REP(i,m,n) for(int i=(m);i<(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define all(a) a.begin(),a.end()
#define rall(c) (c).rbegin(),(c).rend()
#define mp make_pair
#define endl '\n'
#define vec vector<ll>
#define mat vector<vector<ll> >
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll,ll> pll;
typedef long double ld;
typedef complex<double> comp;
const ll inf=1e9+7;
const ll mod=998244353;
const int MAX=200010;

//Union-Find木


int siz[MAX];
int par[MAX];
int depth[MAX];
void init(int n){
  for(int i=0;i<=n;i++){
      par[i]=i;
      depth[i]=0;
  }
  rep(i,n+1){
      siz[i]=1;
  }
}
int root(int x){
  return par[x]==x?x:par[x]=root(par[x]);
}
bool same(int x,int y){
  return root(x)==root(y);
}
void unite(int x,int y){
  x=root(x);
  y=root(y);
  ll sx=siz[x];
  ll sy=siz[y];
  if(x==y)return;
  if(depth[x]<depth[y]){
      par[x]=y;
  }else{
      par[y]=x;
      if(depth[x]==depth[y])depth[x]++;
  }
  siz[root(x)]=sx+sy;
}

signed main(){
    ll n,k;cin>>n>>k;
    vector<ll>a(n);
    rep(i,n)cin>>a[i];
    init(n);
    rep(j,10){
        ll la=-1;
        rep(i,n){
            if(a[i]&(1LL<<j)){
                if(la==-1)la=i;
                else unite(i,la);
            }
        }
    }
    vector<ll>used(n);
    ll cnt=0;
    vector<ll>b(0);
    rep(i,n){
        if(used[root(i)])continue;
        used[root(i)]=1;
        cnt++;
        b.pb(siz[root(i)]);
    }
    if(cnt<k){
        cout<<0<<endl;
        return 0;
    }
    vector<vector<ll> >dp(cnt+1,vector<ll>(k+1));
    dp[0][0]=1;
    rep(i,cnt){
        rep(j,k+1){
            dp[i+1][j]=(dp[i+1][j]+dp[i][j])%mod;
            if(j<k){
                dp[i+1][j+1]=(dp[i+1][j+1]+dp[i][j]*b[i]%mod)%mod;
            }
        }
    }
    cout<<dp[cnt][k]<<endl;
}