MOD = 998244353
N, K = map(int, input().split())
C = list(map(int, input().split()))
D = list(map(int, input().split()))
CD = []
for c, d in zip(C, D):
    CD.append((c, d))
CD.sort()
dp = [[-1, -1] for _ in range(K+1)]
dp[0] = [0, 1]
for k in range(K):
    if dp[k][0]==-1:
        continue
    for c, d in CD:
        if c+k>K:
            break
        if dp[c+k][0]<dp[k][0]+d:
            dp[c+k] = [dp[k][0]+d, dp[k][1]]
        elif dp[c+k][0]==dp[k][0]+d:
            dp[c+k][1] += dp[k][1]
            dp[c+k][1] %= MOD

#print(dp)
ma = 0
ans = 0
for d, cnt in dp:
    if ma<d:
        ma = d
        ans = cnt
    elif ma==d:
        ans += cnt
        ans %= MOD
print(ma)
print(ans)