#include <iostream>
#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <vector>
#include <string>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)

long long mod = 998244353;
long long N, K, A[1 << 18], C[1 << 18];
long long dp[1024][14];

int main() {
	cin >> N >> K;
	for (int i = 1; i <= N; i++) cin >> A[i];
	for (int i = 1; i <= N; i++) C[A[i]] += 1;

	dp[0][0] = 1;
	for (int i = 1; i < 1024; i++) {
		for (int j = 0; j < 1024; j++) {
			for (int k = 0; k <= 10; k++) {
				if ((j & i) != 0) continue;
				dp[j + i][k + 1] += 1LL * C[i] * dp[j][k];
				dp[j + i][k + 1] %= mod;
			}
		}
	}

	long long ret = 0;
	for (int i = 0; i < 1024; i++) {
		if (K <= 11) ret += dp[i][K];
	}
	cout << ret % mod << endl;
	return 0;
}