N, W = map(int, input().split())
A = [list(map(int, input().split())) for _ in range(N)]
A.sort(key=lambda x:x[1])

MOD = 998244353
INF = 10**18

dp = [[-INF]*20001 for _ in range(N+1)]
dp[0][10000] = 0
for i in range(N):
    v, w = A[i]
    for j in range(20001):
        if dp[i][j] == -INF:
            continue
        dp[i+1][j] = max(dp[i+1][j], dp[i][j])
        if j+w <= 20000:
            dp[i+1][j+w] = max(dp[i+1][j+w], dp[i][j]+v)
MAX = max(dp[-1][:10000+W+1])
cnt = [[0]*20001 for _ in range(N+1)]
cnt[0][10000] = 1
for i in range(N):
    v, w = A[i]
    for j in range(20001):
        if dp[i][j] == -INF:
            continue
        if dp[i][j] == dp[i+1][j]:
            cnt[i+1][j] += cnt[i][j]
            cnt[i+1][j] %= MOD
        if j+w <= 20000 and dp[i][j]+v == dp[i+1][j+w]:
            cnt[i+1][j+w] += cnt[i][j]
            cnt[i+1][j+w] %= MOD

ans = 0
for i in range(10000+W+1):
    if dp[-1][i] == MAX:
        ans += cnt[-1][i]
        ans %= MOD

print(MAX, ans)