#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

using mint = modint998244353;

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

int main() {
    ll N, W;
    cin >> N >> W;
    vector<ll> v(N);
    vector<ll> w(N);
    for (ll i = 0; i < N; i++) {
        cin >> v[i] >> w[i];
    }
    ll INF = 100000000000023;
    vector<vector<ll>> dp1(N + 1, vector<ll>(W + 1 + 30000, -INF));
    vector<vector<ll>> dp2(N + 1, vector<ll>(W + 1 + 30000, 0));
    dp1[0][10000] = 0;
    dp2[0][10000] = 1;
    for (ll i = 0; i < N; i++) {
        for (ll j = 0; j <= W + 30000; j++) {
            // 選ばないとき
            ll next = dp1[i][j];
            if (dp1[i + 1][j] < next) {
                dp2[i + 1][j] = dp2[i][j];
                dp1[i + 1][j] = next;
            } else if (dp1[i + 1][j] == next) {
                dp2[i + 1][j] = (dp2[i + 1][j] + dp2[i][j]) % mod2;
                dp1[i + 1][j] = next;
            }

            // 選ぶとき
            ll nv = j + w[i];
            if (nv >= 0 && nv <= W + 30000) {
                ll next = dp1[i][j] + v[i];
                if (dp1[i + 1][nv] < next) {
                    dp2[i + 1][nv] = dp2[i][j];
                    dp1[i + 1][nv] = next;
                } else if (dp1[i + 1][nv] == next) {
                    dp2[i + 1][nv] = (dp2[i + 1][nv] + dp2[i][j]) % mod2;
                    dp1[i + 1][nv] = next;
                }
            }
        }
    }
    /*for (ll i = 0; i <= N; i++) {
        for (ll j = -10; j <= 10; j++) {
            cout << dp1[i][10000 + j] << " ";
        }
        cout << endl;
    }
    for (ll i = 0; i <= N; i++) {
        for (ll j = -10; j <= 10; j++) {
            cout << dp2[i][10000 + j] << " ";
        }
        cout << endl;
    }*/
    ll max_ans = -INF;
    ll max_idx = -1;
    for (ll i = 0; i <= W + 10000; i++) {
        if (dp1[N][i] > max_ans) {
            max_ans = dp1[N][i];
        }
    }
    ll ans = 0;
    for (ll i = 0; i <= W + 10000; i++) {
        if (dp1[N][i] == max_ans) {
            ans += dp2[N][i];
            ans %= mod2;
        }
    }
    cout << max_ans << " " << ans << endl;
}