mod = 998244353

def main():

    n, k = map(int, input().split())
    A = list(map(int, input().split()))

    if k > 10:
        print(0)
        exit()

    C = [0]*(1<<10)
    for a in A:
        C[a] += 1

    k = min(k, 10)
    dp = [[0]*(1<<10) for i in range(k+1)]
    dp[0][0] = 1
    for i in range(k):
        for s in range(1<<10):
            for j, c in enumerate(C):
                if (s&j) == 0:
                    ns = s|j
                    dp[i+1][ns] += dp[i][s]*c
                    dp[i+1][ns] %= mod

    f = 1
    for i in range(1, k+1):
        f *= i
        f %= mod
    inv_f = pow(f, mod-2, mod)
    ans = 0
    for s in range(1<<10):
        ans += dp[k][s]
        ans %= mod
    ans *= inv_f
    ans %= mod
    print(ans)

if __name__ == '__main__':
    main()