#include <atcoder/all>
#include <bits/stdc++.h>
#define rep(i, a, b) for (ll i = (ll)(a); i < (ll)(b); i++)
using namespace atcoder;
using namespace std;

typedef long long ll;
using mint = modint998244353;

template <typename T> ostream &operator<<(ostream &os, const vector<T> &v) {
    int n = v.size();
    rep(i, 0, n) { os << v[i] << " \n"[i == n - 1]; }
    return os;
}

int main() {
    ll n, w;
    cin >> n >> w;
    vector<ll> dp(30010, -2e9);
    vector<mint> pat(30010);
    int mid = 15000;
    int lim = mid + w;
    dp[mid] = 0;
    pat[mid] = 1;
    rep(i, 0, n) {
        ll nw, nv;
        cin >> nv >> nw;
        vector<ll> ndp = dp;
        vector<mint> npat = pat;

        rep(j, 0, 30010) {
            if (0 <= j + nw && j + nw < 30010) {
                if (ndp[j + nw] < dp[j] + nv) {
                    ndp[j + nw] = dp[j] + nv;
                    npat[j + nw] = pat[j];
                } else if (ndp[j + nw] == dp[j] + nv) {
                    npat[j + nw] += pat[j];
                }
            }
        }
        swap(dp, ndp);
        swap(pat, npat);
    }
    ll ans = 0;
    rep(i, 0, lim + 1) {
        if (dp[i] == -2e9)
            continue;
        if (ans < dp[i]) {
            ans = dp[i];
        }
    }
    mint pats = 0;
    rep(i, 0, lim + 1) {
        if (dp[i] == ans) {
            pats += pat[i];
        }
    }
    cout << ans << ' ' << pats.val() << endl;
}