u=[1]*10**6
u2=[1]*(10**6)
mod=998244353
for i in range(1,10**6):
  u[i]=u[i-1]*i
  u[i]%=mod
u2[10**6-1]=pow(u[10**6-1],-1,mod)
for i in range(10**6-2,0,-1):
  u2[i]=u2[i+1]*(i+1)
  u2[i]%=mod
def ncm(x,y):
  if y>x or y<0:
    return 0
  ans=u[x]*u2[y]
  ans%=mod
  ans*=u2[x-y]
  ans%=mod
  return ans
N,K=map(int,input().split())
c1=1
c0=1
A=list(map(int,input().split()))
q=1
for i in range(N):
  x=A[i]
  c1*=min(K,x)
  c0*=min(K-1,x)
  c1%=mod
  c0%=mod
  q*=x
  q%=mod
print(c1,c0)
result=(c1-c0)*pow(q,-1,mod)
result%=mod
print(result)