#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;
const ll MOD=998244353;
ll powmod(ll a, ll k){
    ll ap=a, ans=1;
    while(k){
        if(k&1){
            ans*=ap;
            ans%=MOD;
        }
        ap=ap*ap;
        ap%=MOD;
        k>>=1;
    }
    return ans;
}
ll inv(ll a){
    return powmod(a, MOD-2);
}
ll dp[11][1<<10];
int main()
{
    int n, k;
    cin>>n>>k;
    if(k>10){
        cout<<0<<endl;
        return 0;
    }
    int a[200020];
    for(int i=0; i<n; i++) cin>>a[i];
    int cnt[1<<10]={};
    for(int i=0; i<n; i++) cnt[a[i]]++;
    dp[0][0]=1;
    for(int i=1; i<(1<<10); i++){
        for(int j=i; j>0; j=(j-1)&i){
            for(int l=1; l<=k; l++){
                dp[l][i]+=dp[l-1][i-j]*cnt[j];
                dp[l][i]%=MOD;
            }
        }
    }
    ll ans=0;
    for(int i=0; i<(1<<10); i++) (ans+=dp[k][i])%=MOD;
    for(int i=2; i<=k; i++) (ans*=inv(i))%=MOD;
    cout<<ans<<endl;
    return 0;
}