#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
#define rep(i, n) for(int i=0;i<(n);++i)
#define rep1(i, n) for(int i=1;i<=(n);i++)
#define ll long long
using mint = modint998244353;
using P = pair<ll,ll>;
using lb = long double;
using T = tuple<ll, ll, ll>;
#ifdef LOCAL
#  include <debug_print.hpp>
#  define dbg(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define dbg(...) (static_cast<void>(0))
#endif

int main()
{
    int n, W;
    cin >> n >> W;
    int base = 10000;
    vector<ll> dp(3*base+1, -1e18);
    dp[base] = 0;
    vector<mint> cnt(3*base+1);
    cnt[base] = 1;
    rep(i,n) {
        vector<ll> p(3*base+1, -1e18);
        vector<mint> pcnt(3*base+1);
        swap(dp, p);
        swap(cnt, pcnt);
        int v, w;
        cin >> v >> w;
        for(int j=0;j<3*base+1;j++){
            if(p[j]>dp[j]) {
                dp[j] = p[j];
                cnt[j] = pcnt[j];
            }
            else if(p[j]==dp[j]) {
                cnt[j] += pcnt[j];
            }
            if(j+w<=3*base) {
                if(p[j]+v>dp[j+w]) {
                    dp[j+w] = p[j] + v;
                    cnt[j+w] = pcnt[j];
                }
                else if(p[j]+v==dp[j+w]) {
                    cnt[j+w] += pcnt[j]; 
                }
            }            
        }
    }   
    int id = max_element(dp.begin(),dp.begin()+W+base+1) - dp.begin();
    mint ans = 0;
    rep(i,W+base+1) if(dp[i]==dp[id]) ans += cnt[i];
    cout << dp[id] << " " << ans.val() << endl;
    return 0;
}