#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
//const int INF = 1e9;
const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n) - 1; i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r) - 1;i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }
pair<long long, mint>marge(const pair<long long, mint>& l, const pair<long long, mint> &r) {
	if (l.first == r.first)return{ l.first,l.second + r.second };
	else if (l.first > r.first)return l;
	return r;
}
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	vector<int>v(n), w(n);
	rep(i, n)cin >> v[i] >> w[i];
	const int X = 10000;
	const int LIM = 10000 + m + X;
	// dp[i][weight]:={value,count};
	vector dp(n + 1, vector<pair<long long, mint>>(LIM + 1, { -LINF,0 }));
	dp[0][X] = { 0,1 };
	rep(i, n) {
		int ni = i + 1;
		rep(j, LIM + 1) {
			if (0 == dp[i][j].second)continue;
			// nouse
			{
				int nj = j + 0;
				dp[ni][nj] = marge(dp[ni][nj], dp[i][j]);
			}
			// use
			{
				int nj = j + w[i];
				if (nj > LIM)continue;
				if (nj < 0)nj = 0;
				int nf = dp[i][j].first + v[i];
				mint ns = dp[i][j].second;
				dp[ni][nj] = marge(dp[ni][nj], { nf,ns });
			}
		}
	}
	pair<long long, mint> ans = { -LINF,0 };
	rep(i, m + X + 1)ans = marge(ans, dp[n][i]);
	cout << ans.first << " " << ans.second.val() << endl;
	return 0;
}