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

using namespace std;
using mint = modint998244353;

struct modfact {
  int n; vector<mint> d;
  modfact(): n(2), d({1,1}) {}
  mint operator()(int i) {
    while (n <= i) d.push_back(d.back()*n), ++n;
    return d[i];
  }
  mint operator[](int i) const { return d[i];}
} facts;

int main() {
    int n, k;
    cin >> n >> k;
    
    vector<int> a(n);
    rep(i, n) cin >> a[i];
    
    if (k > 10) {
        puts("0");
        return 0;
    }
    
    unordered_map<int, int> cnt;
    rep(i, n) cnt[a[i]]++;
    
    int m = 10, m2 = 1<<m;
    vector dp(m+1, vector<mint>(m2));
    dp[0][0] = 1;
    rep(i, k)rep(s, m2) {
        for (int t = s; t; t = (t-1)&s) {
            dp[i+1][s] += dp[i][s^t]*cnt[t];
        }
    }
    
    mint ans;
    rep(s, m2) ans += dp[k][s];
    ans /= facts(k);
    
    cout << ans.val() << '\n';
    
    return 0;
}