using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
    }
    static void Solve()
    {
        var c = NList;
        var (n, k) = (c[0], c[1]);
        var a = NList;
        var ans = 0;
        foreach (var ncr in NCRList(n, k))
        {
            var s1 = 0;
            var s2 = 0;
            foreach (var ni in ncr)
            {
                s1 = (s1 + a[ni]) % 998;
                s2 = (s2 + a[ni]) % 998244353;
            }
            if (s1 >= s2)
            {
                ++ans;
            }
        }
        WriteLine(ans % 998);
    }
    static IEnumerable<int[]> NCRList(int n, int r)
    {
        var ans = new int[r];
        for (var i = 0; i < ans.Length; ++i) ans[i] = i;
        ans[ans.Length - 1] = ans.Length - 2;
        var pos = r - 1;
        while (pos >= 0)
        {
            ++ans[pos];
            while (pos < r - 1)
            {
                ++pos;
                ans[pos] = ans[pos - 1] + 1;
            }
            if (pos == r - 1)
            {
                yield return ans;
            }
            while (pos >= 0 && ans[pos] == n + pos - r)
            {
                --pos;
            }
        }
    }
}