#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;

using lint = long long;
using mint = atcoder::modint998244353;

lint INF = 2000000000;

int main() {
    int n, W;
    cin >> n >> W;
    vector<lint> v(n), w(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i] >> w[i];
        w[i];
    }
    vector<vector<lint>> dp(n + 1, vector<lint>(20010, -INF));
    dp[0][10000] = 0;
    for (int i = 1; i <= n; i++) {
        for (int j = 0; j < 20010; j++) {
            dp[i][j] = max(dp[i][j], dp[i - 1][j]);
            if (0 <= j - w[i - 1] && j - w[i - 1] < 20010) {
                dp[i][j] = max(dp[i][j], dp[i - 1][j - w[i - 1]] + v[i - 1]);
            }
        }
    }
    lint ans = -INF;
    for (int j = 0; j <= W + 10000; j++) {
        ans = max(ans, dp[n][j]);
    }
    
    vector<vector<mint>> cnt(n + 1, vector<mint>(20010));
    for (int j = 0; j < 20010; j++) {
        if (dp[n][j] == ans) {
            cnt[n][j] = 1;
        }
    }
    for (int i = n; i >= 1; i--) {
        for (int j = 0; j < 20010; j++) {
            if (0 <= j - w[i - 1] && j - w[i - 1] < 20010) {
                if (dp[i - 1][j] == dp[i][j]) {
                    cnt[i - 1][j] += cnt[i][j];
                }
                if (dp[i - 1][j - w[i - 1]] == dp[i][j] - v[i - 1]) {
                    cnt[i - 1][j - w[i - 1]] += cnt[i][j];
                }
            }
        }
    }
    
    mint ans2 = 0;
    for (int j = 0; j < 20010; j++) {
        ans2 += cnt[0][j];
    }
    
    cout << ans << " " << ans2.val() << endl;
}