// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "\033[32m[" << __LINE__ << "]\033[0m "
#define SZ(x) ((int) x.size() - 1)
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> T& chkmax(T& x, T y) {return x = max(x, y);}
template <typename T> T& chkmin(T& x, T y) {return x = min(x, y);}
template <typename T> T& read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	return x *= f;
}
const int N = (1 << 22) | (1 << 10), MOD = 998244353;
const ll INF = 1e18;
int n, w, s[N];
pair <int, int> a[25];
pair <ll, int> f[N];
// int lg(int x) {return 31 ^ __builtin_clz(x);}
pair <ll, int> operator * (pair <ll, int> x, pair <ll, int> y) {
	return make_pair(x.first + y.first, (ll) x.second * y.second % MOD);
}
pair <ll, int> operator + (pair <ll, int> x, pair <ll, int> y) {
	if (x.first ^ y.first) return min(x, y);
	return make_pair(x.first, (x.second + y.second) % MOD);
}
pair <ll, int>& operator += (pair <ll, int>& x, pair <ll, int> y) {
	return x = x + y;
}
vector <int> g[N];
signed main() {
	read(n), read(w);
	F(i, 1, n) read(a[i].second), read(a[i].first);
	sort(a + 1, a + n + 1, greater ());
	f[0] = make_pair(0, 1);
	int full = (1 << n) - 1;
	F(i, 1, full) {
		int t = __builtin_ctz(i);
		// debug << i << " " << t << " " << a[t + 1].first << endl;
		s[i] = min(w + 1, s[i ^ (1 << t)] + a[t + 1].second);
		f[i] = make_pair(INF, 0);
		if (s[i] <= w) {
			// debug << i << endl;
			for (int j = i; ; j = (j + 1) | i) {
				if (__builtin_ctz(j) == t) {
					// debug << j << " " << i << endl;
					g[j].push_back(i);
				}
				if (j == full) break;
			}
		}
	}
	F(i, 1, full) {
		int t = __builtin_ctz(i);
		for (int l: g[i]) {
			// if ((i ^ b) == 3) {
			// 	debug << "! " << s[i ^ b] << " " << w << endl;
			// }
			// if (s[i ^ b] <= w) {
				// debug << (i ^ a) << endl;
				f[i] += make_pair(::a[t + 1].first + f[i ^ l].first, f[i ^ l].second);
				// if (a[t + 1].first + f[a].first < f[i].first) {
				// 	f[i].first = 
				// }
			// }
			// if (!b) break;
		}
		// debug << f[i].first << " " << f[i].second << " " << s[i] << endl;
	}
	cout << f[full].first << ' ' << f[full].second;
	return 0;
}
/* why?
*/