n, k = map(int, input().split())
C = list(map(int, input().split()))
D = list(map(int, input().split()))
mod = 998244353

DP = [[0, 0] for _ in range(k + 1)]
DP[0] = [0, 1]
for i in range(k + 1):
    if DP[i][1] == 0:
        continue
    for j in range(n):
        c, d = C[j], D[j]
        if i + c <= k:
            if DP[i][0] + d > DP[i + c][0]:
                DP[i + c][0] = DP[i][0] + d
                DP[i + c][1] = DP[i][1]
            elif DP[i][0] + d == DP[i + c][0]:
                DP[i + c][1] += DP[i][1]
                DP[i + c][1] %= mod
ans1, ans2 = 0, 0
for i in range(k + 1):
    if DP[i][0] > ans1:
        ans1 = DP[i][0]
        ans2 = DP[i][1]
    elif DP[i][0] == ans1:
        ans2 += DP[i][1]
        ans2 %= mod
print(ans1)
print(ans2)