#include <bits/stdc++.h>
using namespace std;
template <typename T> using min_priority_queue = priority_queue<T,vector<T>,greater<T>>;

template<typename T>
void printv(vector<T> &v){
    bool b = false;
    for(auto i : v){
        if(b) cout << " ";
        else b = true;
        cout << i;
    }
    cout << endl;
}

template <typename T>
bool chmin(T &a, const T& b) {
    if (a > b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

template <typename T>
bool chmax(T &a, const T& b) {
    if (a < b) {
        a = b;  // aをbで更新
        return true;
    }
    return false;
}

void yn(bool b){
    if(b) cout << "Yes" << endl;
    else cout << "No" << endl;
}

bool debug;
bool randomInput;
void input(){
    if(debug && randomInput){
        
    }
    else{
        
    }
    return;
}

void calc(){
    int64_t a = 998;
    int64_t b = 998244353;
    int N, K;
    cin >> N >> K;
    vector<int64_t> A(N);
    for(int i = 0; i < N; i++){
        cin >> A[i];
    }
    vector<int> loop(N,0);
    for(int i = N-1; i >= N-K; i--){
        loop[i] = 1;
    }

    int cnt = 0;
    do{
        int64_t moda = 0;
        int64_t modb = 0;
        for(int i = 0; i < N; i++){
            if(loop[i]){
                moda += A[i];
                moda %= a;
                modb += A[i];
                modb %= b;
            }
        }

        if(modb <= moda) cnt++;
    }while(next_permutation(loop.begin(), loop.end()));

    cnt %= 998;
    cout << cnt << endl;
    return;
}

int64_t ansSimple;
void calcSimple(){
    return;
}

void calc1(){
    int t; cin >> t;
    for(int i = 0; i < t; i++){
        input();
        calc();
        calcSimple();
    }
}

int main(){
    debug = 0;
    randomInput = 0;
    srand(time(NULL));
    cout << fixed << setprecision(12);
    if(debug){
        calc1();
    }
    else{
        input();
        calc();
    }
    return 0;
}
//