n,k = map(int,input().split())
C = list(map(int,input().split()))
D = list(map(int,input().split()))
mod = 998244353
inf = 10**10
dp = [-inf]*(k+1)

dp[0] = 0
dp2 = [0]*(k+1)
dp2[0] = 1
for i in range(k):

    if dp[i] == -inf:
        continue

    for c,d in zip(C,D):
        if i+c <= k:
            if dp[i+c] < dp[i]+d:
                dp[i+c] = dp[i]+d
                dp2[i+c] = dp2[i]
            elif dp[i+c] == dp[i]+d:
                dp2[i+c] += dp2[i]
                dp2[i+c] %= mod

ans1 = max(dp)

ans2 = 0

for i in range(k+1):
    if dp[i] == ans1:
        ans2 += dp2[i]
        ans2 %= mod
print(ans1)
print(ans2)