#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;
    lint W;
    cin >> n >> W;
    vector<lint> v(n), w(n);
    for (int i = 0; i < n; i++) {
        cin >> v[i] >> w[i];
    }
    map<lint, pair<lint, mint>> dp, ndp;
    dp[0] = {0, 1};
    for (int i = 0; i < n; i++) {
        ndp = dp;
        for (auto [j, p] : dp) {
            if (!dp.count(j + w[i])) {
                ndp[j + w[i]] = {-INF, 0};
            }
        }
        for (auto [j, p] : dp) {
            if (ndp[j + w[i]].first < dp[j].first + v[i]) {
                ndp[j + w[i]] = {dp[j].first + v[i], dp[j].second};
            } else if (ndp[j + w[i]].first == dp[j].first + v[i]) {
                ndp[j + w[i]].second += dp[j].second;
            }
        }
        swap(dp, ndp);
    }
    lint val = -INF;
    for (auto [x, p] : dp) {
        if (x <= W) {
            val = max(val, dp[x].first);
        }
    }
    mint ans = 0;
    for (auto [x, p] : dp) {
        if (x <= W && dp[x].first == val) {
            ans += dp[x].second;
        }
    }
    cout << val << " " << ans.val() << endl;
}