MOD = 998244353
INFTY = 10**8
N,W = map(int,input().split())
A = [0]+[list(map(int,input().split())) for _ in range(N)]
B = [j for j in range(-10000,W+10000+1)]
K = len(B)
C = {B[i]:i for i in range(K)}
dp = [[-INFTY for _ in range(K)] for _ in range(N+1)]
for j in range(K):
    if B[j]>=0:
        dp[1][j] = 0
    if A[1][1]<=B[j]:
        dp[1][j] = max(dp[1][j],A[1][0])
for i in range(2,N+1):
    for j in range(K):
        if B[j]>=0:
            dp[i][j] = 0
        dp[i][j] = max(dp[i][j],dp[i-1][j])
        if -10000<=B[j]-A[i][1]<=W+10000:
            dp[i][j] = max(dp[i][j],dp[i-1][C[B[j]-A[i][1]]]+A[i][0])
F = [[0 for _ in range(K)] for _ in range(N+1)]
for j in range(K):
    if dp[1][j]<=-INFTY:
        F[1][j] = 0
    else:
        F[1][j] = 1
for i in range(2,N+1):
    for j in range(K):
        if -10000<=B[j]-A[i][1]<=W+10000 and dp[i][j]>dp[i-1][j]:
            F[i][j] = F[i-1][C[B[j]-A[i][1]]]
        elif -10000<=B[j]-A[i][1]<=W+10000 and dp[i-1][j]>dp[i-1][C[B[j]-A[i][1]]]+A[i][0]:
            F[i][j]=F[i-1][j]
        elif -10000<=B[j]-A[i][1]<=W+10000 and dp[i-1][j]==dp[i-1][C[B[j]-A[i][1]]]+A[i][0]:
            F[i][j] = (F[i-1][j]+F[i-1][C[B[j]-A[i][1]]])%MOD
print(dp[N][C[W]],F[N][C[W]])