MOD = 998244353
n,m = map(int,input().split())
*p, = map(int,input().split())
for i in range(n):
    p[i] -= 1
#from collections import Counter
#d = Counter()
res = []
for i in range(n):
    if p[i] == -1: continue
    c = 0
    while p[i] != -1:
        ni = p[i]
        p[i] = -1
        i = ni
        c += 1
    res.append(c)
    #d[c] += 1


dp = [0]*(m+1)
dp[0] = 1
for c in res:
    #print(c,dp)
    ndp = [0]*(m+1)
    for i in range(m+1):
        ndp[i] += i*dp[i]
        ndp[i] %= MOD
        if i < m: ndp[i+1] += dp[i]
    dp = ndp
    #print(dp,"now")
    dp2 = [0]*(m+1)
    for _ in range(c-2):
        ndp = [0]*(m+1)
        ndp2 = [0]*(m+1)
        for i in range(1,m+1):
            ndp2[i] += dp[i]*(i-1)
            ndp2[i] += dp2[i]*(i-2)
            ndp2[i] %= MOD
            ndp[i] += dp2[i]
            ndp[i] %= MOD
            if i < m:
                ndp2[i+1] += dp[i] + dp2[i]
        dp = ndp
        dp2 = ndp2
    #print(dp,dp2)
    ndp = [0]*(m+1)
    for i in range(m+1):
        ndp[i] += (i-1)*dp[i]
        ndp[i] += (i-2)*dp2[i]
        ndp[i] %= MOD
        if i < m:
            ndp[i+1] += dp[i] + dp2[i]
            ndp[i+1] %= MOD
    dp = ndp
print(dp[-1])