import java.io.*;
import java.util.*;
import java.util.function.*;
import java.util.stream.*;

public class Main {
    static int ans = 0;
    static final int MOD1 = 998244353;
    static final int MOD2 = 998;
    static int[] values;
    public static void main(String[] args) throws Exception {
        Scanner sc = new Scanner();
        int n = sc.nextInt();
        int k = sc.nextInt();
        values = new int[n];
        for (int i = 0; i < n; i++) {
            values[i] = sc.nextInt();
        }
        check(n - 1, k - 1, 0, 0);
        System.out.println(ans);
    }
    
    static void check(int idx, int count, int v1, int v2) {
        if (count < 0) {
            if (v1 <= v2) {
                ans++;
                ans %= MOD2;
            }
            return;
        }
        if (idx < count) {
            return;
        }
        check(idx - 1, count - 1, (v1 + values[idx]) % MOD1, (v2 + values[idx]) % MOD2);
        check(idx - 1, count, v1, v2);
    }
}
class Scanner {
    BufferedReader br;
    StringTokenizer st = new StringTokenizer("");
    StringBuilder sb = new StringBuilder();
    
    public Scanner() {
        try {
            br = new BufferedReader(new InputStreamReader(System.in));
        } catch (Exception e) {
            
        }
    }
    
    public int nextInt() {
        return Integer.parseInt(next());
    }
    
    public long nextLong() {
        return Long.parseLong(next());
    }
    
    public double nextDouble() {
        return Double.parseDouble(next());
    }
    
    public String next() {
        try {
            while (!st.hasMoreTokens()) {
                st = new StringTokenizer(br.readLine());
            }
        } catch (Exception e) {
            e.printStackTrace();
        } finally {
            return st.nextToken();
        }
    }
    
}