def oi(): return int(input())
def os(): return input().rstrip()
def mi(): return list(map(int, input().split()))

# import sys
# input = sys.stdin.readline
# import sys
# sys.setrecursionlimit(10**8)
# import pypyjit
# pypyjit.set_param('max_unroll_recursion=-1')
input_count = 0

N,W = mi()
items = []
for _ in range(N):
    v,w = mi()
    items.append((w,v))


items.sort()


mod = 998244353
mins = 10000
value_dp = [[-1*float("inf")]*(mins +W + 10) for _ in range(N+1)]
num_dp = [[-1*float("inf")]*(mins +W + 10) for _ in range(N+1)]

for i in range(1, N+1):
    w,v = items[i-1]
    if 0 <= w+mins <= W+mins:
        value_dp[i][w+mins] = v
        num_dp[i][w+mins] = 1

    for j in range(W+1 + mins):
        # 
        if value_dp[i][j] < value_dp[i-1][j]:
            num_dp[i][j] = num_dp[i-1][j]
        elif value_dp[i][j] == value_dp[i-1][j]:
            num_dp[i][j] = (num_dp[i][j] + num_dp[i-1][j])%mod
        value_dp[i][j] = max(value_dp[i][j], value_dp[i-1][j])



        if 0 <= j+w <= W+mins and value_dp[i-1][j]!=0:
            if value_dp[i][j+w] < value_dp[i-1][j] + v: 
                value_dp[i][j+w] = value_dp[i-1][j] + v
                num_dp[i][j+w] = num_dp[i-1][j]
            elif value_dp[i][j+w] == (value_dp[i-1][j] + v):
                # value_dp[i][j+w] = max(value_dp[i][j+w], value_dp[i-1][j] + v)

                num_dp[i][j+w] = (num_dp[i][j+w] + num_dp[i-1][j])%mod
sums = 0
maxs_v = max(value_dp[-1][:W+mins + 1])
for i in range(W+mins + 1):
    if value_dp[-1][i] == maxs_v:

        sums = (num_dp[-1][i] + sums)%mod

if maxs_v < 0:
    print(*[0,1])
else:
    print(*[maxs_v, sums])