#include <iostream>
#include <iomanip>
#include <algorithm>
#include <array>
#include <cassert>
#include <utility>
#include <vector>

constexpr int mod = 998244353;

// modint構造体
template <int modulus> struct mod_Int{
    int val; // 値本体
    // コンストラクタ
    constexpr mod_Int():val(0){}
    constexpr mod_Int(const int& v):val(v % modulus){ if(val < 0) val += modulus; }
    constexpr mod_Int(int&& v):val(v % modulus){ if(val < 0) val += modulus; }
    constexpr mod_Int(const long long int& v):val(v % modulus){ if(val < 0) val += modulus; }
    constexpr mod_Int(long long int&& v):val(v % modulus){ if(val < 0) val += modulus; }
    constexpr mod_Int(const unsigned int& v):val(v % modulus){}
    constexpr mod_Int(unsigned int&& v):val(v % modulus){}
    constexpr mod_Int(const unsigned long long int& v):val(v % modulus){}
    constexpr mod_Int(unsigned long long int&& v):val(v % modulus){}
    constexpr mod_Int& operator += (const mod_Int<modulus>& other) noexcept {
        val += other.val; if(val >= modulus) val -= modulus;
        return *this;
    }
    constexpr mod_Int& operator -= (const mod_Int<modulus>& other) noexcept {
        val -= other.val; if(val < 0) val += modulus;
        return *this;
    }
    constexpr mod_Int& operator *= (const mod_Int<modulus>& other) noexcept {
        val = static_cast<long long int>(val) * other.val % modulus;
        return *this; 
    }
    constexpr mod_Int& operator /= (const mod_Int<modulus>& other) noexcept {
        val = static_cast<long long int>(val) * other.inverse() % modulus;
        return *this;
    }
    constexpr bool operator == (const mod_Int<modulus>& other) const noexcept {
        return val == other.val;
    }
    constexpr mod_Int operator +(const mod_Int<modulus>& v) const noexcept{
        return mod_Int<modulus>(*this) += v;
    }
    constexpr mod_Int operator -(const mod_Int<modulus>& v)const noexcept{
        return mod_Int<modulus>(*this) -= v;
    }
    constexpr mod_Int operator *(const mod_Int<modulus>& v) const noexcept{
        return mod_Int<modulus>(*this) *= v;
    }
    constexpr mod_Int operator /(const mod_Int<modulus>& v) const noexcept{
        return mod_Int<modulus>(*this) /= v;
    }
    constexpr mod_Int& operator ++(void) noexcept {
        if(++val == modulus) val = 0;
        return *this;
    }
    constexpr mod_Int& operator --(void) noexcept {
        if(val-- == 0) val = modulus - 1;
        return *this;
    }
    constexpr mod_Int operator -()const noexcept{
        return mod_Int<modulus>((val == 0 ? 0 : modulus - val));
    }

    // aの逆元を求める関数
    static constexpr int inverse(int a) noexcept {
        int b = modulus, 
            u = 1, v = 0;
        while (b != 0) {
            const int t = a / b; 
            a -= t * b; std::swap(a, b);
            u -= t * v; std::swap(u, v);
        }
        if(u < 0) u += modulus;
        return u;
    }
    constexpr int inverse(void) const noexcept { return inverse(val); }
    // a^nを返す関数 : nは負の数でも可
    static constexpr int power(int a, long long int n){
        long long res = 1, waiting = a;
        if(n < 0) waiting = inverse(a), n = -n;
        while(n != 0){ 
            if(n % 2 != 0) res = res * waiting % modulus; 
            waiting = waiting * waiting % modulus; 
            n /= 2;
        }
        return res;
    }
    constexpr mod_Int power(long long int n) const noexcept { mod_Int res; res.val = power(val, n); return res; }
    friend std::ostream& operator << (std::ostream& os_arg, const mod_Int<modulus>& mod_Int_arg){
        os_arg << mod_Int_arg.val;
        return os_arg;
    }
};

using modint = mod_Int<mod>;

template <int modulus>
struct Combination{
    const int sz;
    std::vector<mod_Int<modulus>> Power, Inv_Power, Inv;
    
    // コンストラクタ : n は想定される最大値
    Combination(const int n):sz(n){
        Power.resize(n + 1); Power[0].val = 1;
        mod_Int<modulus> v = 1; for(int i = 1; i <= n; ++i, ++v) Power[i] = Power[i - 1] * v;
        Inv_Power.resize(n + 1); Inv_Power[n] = Power[n].inverse();
        v = n; for(int i = n; i > 0; --i, --v) Inv_Power[i - 1] = Inv_Power[i] * v;
        Inv.resize(n + 1);
        Inv[0] = 0; for(int i = 1; i <= n; ++i) Inv[i] = Inv_Power[i] * Power[i - 1];
    }
    
    // 組み合わせ nCk を求める関数
    mod_Int<modulus> combination(const int n, const int k) const {
        if(k < 0 or n < k) return mod_Int<modulus>();
        return Power[n] * Inv_Power[k] * Inv_Power[n - k];
    }
};


constexpr int LogN = 10;
constexpr int MAX_N = 1 << LogN;
std::array<std::array<modint, LogN + 1>, MAX_N> dp;

int main(void){
    std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); 
    std::cout << std::fixed << std::setprecision(16);

    int n, k; std::cin >> n >> k;
    std::vector<int> A(n); for(int i = 0; i < n; ++i) std::cin >> A[i];
    std::sort(A.begin(), A.end());
    int cnt = 0; while(cnt < n and A[cnt] == 0) ++cnt;
    dp[0][0] = 1;
    for(int idx1 = cnt; idx1 < n; ){
        int idx2 = idx1; while(idx2 < n and A[idx1] == A[idx2]) ++idx2;
        const modint count = idx2 - idx1;
        for(int i = 0; i < MAX_N; ++i) if( (i & A[idx1]) == 0){
            for(int len = 0; len + 1 <= LogN; ++len){
                dp[i | A[idx1]][len + 1] += count * dp[i][len];
            }
        }
        idx1 = idx2;
    }
    Combination<mod> C(n);
    modint res;
    for(int len = 0; len <= LogN; ++len){
        const modint t = C.combination(cnt, k - len);
        if(t.val == 0) continue;
        modint sum = 0; for(int i = 0; i < MAX_N; ++i) sum += dp[i][len];
        res += t * sum;
    }
    std::cout << res << '\n';




    
    return 0;
}