#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < n; i++)
using namespace std;

typedef long long ll;

int main() {
    int N, K;
    cin >> N >> K;
    vector<int> A(N), B(1024, 0);
    rep(i, N) {
        cin >> A[i];
        B[A[i]]++;
    }
    if (K > 10) {
        cout << "0\n";
        return 0;
    }
    vector<vector<vector<ll>>> dp(1024, vector<vector<ll>>(11, vector<ll>(1025, 0)));
    dp[0][0][0] = 1;
    ll MOD = 998244353;
    rep(k, 1024) {
        rep(j, 11) {
            rep(i, 1024) {
                dp[i][j][k + 1] += dp[i][j][k];
                dp[i][j][k + 1] %= MOD;
                if (j == 10) continue;
                if (i & k) continue;
                dp[i ^ k][j + 1][k + 1] += dp[i][j][k] * B[k];
                dp[i ^ k][j + 1][k + 1] %= MOD;
            }
        }
    }
    ll ans = 0;
    rep(i, 1024) {
        ans = (ans + dp[i][K][1024]) % MOD;
    }
    cout << ans << "\n";
    /*
    rep(k, 10) {
        cout << "k=" << k << "\n";
        rep(i, 10) {
            cout << "i=" << i << " ";
            rep(j, 10) {
                cout << dp[i][j][k] << " ";
            }
        }
        cout << "\n";
    }
    */
}