#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>(2, 0)));
    dp[0][0][0] = 1;
    ll MOD = 998244353;
    rep(i, 1024) {
        rep(j, 10) {
            rep(k, 1024) {
                if (i & k) continue;
                dp[i ^ k][j + 1][(k + 1) % 2] += dp[i][j][k % 2] * B[k];
                dp[i ^ k][j + 1][(k + 1) % 2] %= MOD;
            }
        }
    }
    ll ans = 0;
    rep(i, 1024) {
        ans = (ans + dp[i][K][0]) % MOD;
    }
    cout << ans << "\n";
}