N,K=map(int,input().split())
C,D=list(map(int,input().split())),list(map(int,input().split()))
A=[0 for _ in range(1001)]
B=[0 for _ in range(1001)]
for i in range(N):
    if A[C[i]]<D[i]:
        A[C[i]]=D[i]
        B[C[i]]=1
    elif A[C[i]]==D[i]:
        B[C[i]]+=1
dp=[0 for _ in range(1001)]
pat=[0 for _ in range(1001)]
pat[0]=1
for i in range(1,K+1):
    for j in range(1,i+1):
        if dp[i] < dp[i-j]+A[j]:
            pat[i]=pat[i-j]*B[j]
            pat[i]%=998244353
            dp[i]= dp[i-j]+A[j]
        elif dp[i] == dp[i-j]+A[j]:
            pat[i]+=pat[i-j]*B[j]
            pat[i]%=998244353
    if dp[i]==0:
        pat[i]=1
print(dp[K])
print(pat[K])