#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=998244353;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n,k;cin >> n >> k;
    chmin(k,11);
    vector<int> a(n);
    REP(i,n){
        cin >> a[i];
    }
    vector<vector<ll>> dp(k+2,vector<ll>(1024));
    dp[0][0]=1;
    REP(i,n){
        vector<vector<ll>> tp(k+2,vector<ll>(1024));
        REP(j,k+1){
            REP(l,1024){
                if(!dp[j][l]) continue;
                (tp[j][l]+=dp[j][l])%=mod;
                if(!(l&a[i])){
                    (tp[j+1][l+a[i]]+=dp[j][l])%=mod;
                }
            }
        }
        swap(dp,tp);
    }
    ll ans=0;
    REP(i,1024){
        (ans+=dp[k][i])%=mod;
    }
    cout << ans << endl;
}