#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
#include<map>
#include<set>
#include<stack>
#include<queue>
#include<math.h>
using namespace std;
typedef long long ll;
#define int long long
#define double long double
typedef vector<int> VI;
typedef pair<int, int> pii;
typedef vector<pii> VP;
typedef vector<string> VS;
typedef priority_queue<int> PQ;
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; }
#define fore(i,a) for(auto &i:a)
#define REP(i,n) for(int i=0;i<n;i++)
#define eREP(i,n) for(int i=0;i<=n;i++)
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define eFOR(i,a,b) for(int i=(a);i<=(b);++i)
#define SORT(c) sort((c).begin(),(c).end())
#define rSORT(c) sort((c).rbegin(),(c).rend())
#define LB(x,a) lower_bound((x).begin(),(x).end(),(a))
#define UB(x,a) upper_bound((x).begin(),(x).end(),(a))
#define INF 1000000000
#define LLINF 9223372036854775807
#define mod 998244353
#define eps 1e-12 
//priority_queue<int,vector<int>, greater<int> > q2;

int dp[11][1 << 10];
ll modpow(ll a, ll n = mod - 2) {
	ll r = 1;
	while (n) r = r * ((n % 2) ? a : 1) % mod, a = a * a%mod, n >>= 1;
	return r;
}
long long modinv(long long a) {
	return modpow(a, mod - 2);
}

signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);

	int N, K; cin >> N >> K;
	VI A(N);
	map<int, int>mp;
	REP(i, N) {
		cin >> A[i];
		mp[A[i]]++;
	}

	if (10 < K) {
		cout << 0 << endl;
		return 0;
	}

	dp[0][0] = 1;
	REP(i, K) {
		REP(j, 1 << 10) {
			REP(k, 1 << 10) {
				if (j&k)continue;
				dp[i + 1][j | k] += dp[i][j] * mp[k];
				dp[i + 1][j | k] %= mod;
			}
		}
	}
	int ans = 0;

	REP(i, 1 << 10) {
		ans += dp[K][i];
		ans %= mod;
	}
	REP(i, K) {
		ans *= modinv(i + 1);
		ans %= mod;
	}

	cout << ans << endl;

	return 0;
}