n,k = map(int,input().split())
wv = []; k += 10000; z = 998244353
for _ in range(n):
    v,w = map(int,input().split())
    wv.append((w,v))
dp = [[-10**9,0]]*(20001); dp[10000] = [0,1]
for w,v in sorted(wv):
    eq = [[-10**9,0]]*(20001)
    for i,(s,c) in enumerate(dp):
        if s==-10**9 or i+w>k: continue
        if s+v>eq[i+w][0]: eq[i+w] = [s+v,c]
        elif s+v==eq[i+w][0]: eq[i+w][1] += c
    for i in range(20001):
        if dp[i][0]==eq[i][0]: dp[i][1] += eq[i][1]
        else: dp[i] = max(dp[i],eq[i])
x = y = 0
for s,c in dp:
    if s>x: x,y = s,c
    elif s==x: y += c
print(x,y%z)