#include <iostream>
#include <cstdio>
#include <cmath>
#include <ctime>
#include <cstdlib>
#include <cassert>
#include <vector>
#include <list>
#include <stack>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <bitset>
#include <string>
#include <algorithm>
#include <utility>
#define llint long long
#define inf 1e18
#define rep(x, s, t) for(llint (x) = (s); (x) < (t); (x)++)
#define Rep(x, s, t) for(llint (x) = (s); (x) <= (t); (x)++)
#define chmin(x, y) (x) = min((x), (y))
#define chmax(x, y) (x) = max((x), (y))
#define mod 998244353

using namespace std;
typedef pair<llint, llint> P;

llint n, m;
llint a[200005], cnt[1<<10];
llint dp[2][1<<10][11];

int main(void)
{
	ios::sync_with_stdio(0);
	cin.tie(0);
		
	cin >> n >> m;
	for(int i = 1; i <= n; i++) cin >> a[i];
	for(int i = 1; i <= n; i++) cnt[a[i]]++;
	
	if(m > 10){
		cout << 0 << endl;
		return 0;
	}
	
	
	llint M = 1<<10;
	dp[0][0][0] = 1;
	for(int i = 0; i < M-1; i++){
		for(int j = 0; j < M; j++){
			for(int k = 0; k <= m; k++){
				dp[(i+1)%2][j][k] = 0;
			}
		}
		for(int j = 0; j < M; j++){
			for(int k = 0; k <= m; k++){
				(dp[(i+1)%2][j][k] += dp[i%2][j][k]) %= mod;
				if(((i+1) & j) == 0 && k+1 <= m) (dp[(i+1)%2][j|(i+1)][k+1] += dp[i%2][j][k] * cnt[i+1] % mod) %= mod;
			}
		}
	}
	
	llint ans = 0;
	for(int i = 0; i < M; i++) ans += dp[(M-1)%2][i][m], ans %= mod;
	cout << ans << endl;
	
	return 0;
}