//
// Created by yamunaku on 2020/08/22.
//

#include <bits/stdc++.h>

using namespace std;

#define rep(i, n) for(int i = 0; i < (n); i++)
#define repl(i, l, r) for(int i = (l); i < (r); i++)
#define per(i, n) for(int i = ((n)-1); i >= 0; i--)
#define perl(i, l, r) for(int i = ((r)-1); i >= (l); i--)
#define all(x) (x).begin(),(x).end()
#define MOD 998244353
#define MOD1 1000000007
#define IINF 1000000000
#define LINF 1000000000000000000
#define SP <<" "<<
#define CYES cout<<"Yes"<<endl
#define CNO cout<<"No"<<endl
#define CFS cin.tie(0);ios::sync_with_stdio(false)
#define CST(x) cout<<fixed<<setprecision(x)

using ll = long long;
using ld = long double;
using vi = vector<int>;
using mti = vector<vector<int>>;
using vl = vector<ll>;
using mtl = vector<vector<ll>>;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
template<typename T>
using heap = priority_queue<T, vector<T>, function<bool(const T, const T)>>;

int main(){
    //CFS;
    ll n, k;
    cin >> n >> k;
    vi c(1 << 10);
    rep(i, n){
        int a;
        cin >> a;
        c[a]++;
    }
    if(k > 10){
        cout << 0 << endl;
        return 0;
    }
    mtl dp(k + 1, vl(1 << 10, 0));
    dp[0][0] = 1;
    rep(i, 1 << 10){
        rep(j, 1 << 10){
            if(i & j) continue;
            rep(x, k){
                dp[x + 1][i | j] = (dp[x + 1][i | j] + dp[x][j] * c[i]) % MOD;
            }
        }
    }
    ll ans = 0;
    rep(i, 1 << 10){
        ans += dp[k][i];
    }
    cout << ans % MOD << endl;
    return 0;
}