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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

typedef long long ll;

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

int main(){
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);

	int n, W;
	cin >> n >> W;
	const int B = 10000;
	W += B;

	vector<ll> dp1(W+B+1, -1e18);
	vector<mint> dp2(W+B+1, 0);
	dp1[B] = 0;
	dp2[B] = 1;

	rep(i,0,n){
		ll v; cin >> v;
		int w; cin >> w;
		vector<ll> ndp1 = dp1;
		vector<mint> ndp2 = dp2;
		rep(j,0,W+B+1){
			if (0 <= j+w && j+w <= W+B) {
				if (ndp1[j+w] < dp1[j] + v) {
					ndp1[j+w] = dp1[j] + v;
					ndp2[j+w] = dp2[j];
				}else if(ndp1[j+w] == dp1[j] + v) {
					ndp2[j+w] += dp2[j];
				}
			}
		}
		swap(ndp1, dp1);
		swap(ndp2, dp2);
	}

	ll now = -1e18;
	mint ans = 0;
	rep(i,0,W+1){
		if (dp1[i] > now) {
			now = dp1[i];
			ans = dp2[i];
		}else if(dp1[i] == now) {
			ans += dp2[i];
		}
	}

	cout << now << ' ' << ans.val() << '\n';
}