inf = 1 << 61
mod = 998244353
N,W = map(int,input().split())
B = []
for i in range(N):
  v,w = map(int,input().split())
  B.append((w,v))
B.sort()

dp = [[-inf for w in range(20001)] for n in range(N + 1)]
C = [[0 for c in range(20001)] for n in range(N + 1)]
dp[0][0] = 0
C[0][0] = 1

for i in range(N):
  for w in range(-10000,10001):
    dp[i + 1][w] = dp[i][w]
    C[i + 1][w] = C[i][w]
  w,v = B[i]
  for ww in range(-10000,10001):
    if -10000 <= w + ww <= 10000:
      if dp[i][ww] + v > dp[i + 1][w + ww]:
        dp[i + 1][w + ww] = dp[i][ww] + v
        C[i + 1][w + ww] = C[i][ww]
      elif dp[i][ww] + v == dp[i + 1][w + ww]:
        C[i + 1][w + ww] = (C[i + 1][w + ww] + C[i][ww]) % mod

V = -inf
for w in range(-10000,W + 1):
  V = max(dp[N][w],V)
ans = 0
for w in range(-10000,W + 1):
  if V == dp[N][w]:
    ans += C[N][w]
  ans %= mod
print(V,ans)