import sys
from itertools import permutations
import heapq

input = lambda :sys.stdin.readline().rstrip()
mi = lambda :map(int,input().split())
li = lambda :list(mi())

mod = 998244353

N,K = mi()
C = li()
D = li()

dp_happy = [0] * (K+1)
dp_way = [1] * (K+1)

for k in range(1,K+1):
    for i in range(N):
        if C[i] <= k:
            if D[i] + dp_happy[k-C[i]] > dp_happy[k]:
                dp_happy[k] = D[i] + dp_happy[k-C[i]]
                dp_way[k] = dp_way[k-C[i]]
            elif D[i] + dp_happy[k-C[i]] == dp_happy[k]:
                dp_way[k] += dp_way[k-C[i]]
                dp_way[k] %= mod

print(dp_happy[K])
print(dp_way[K])