#include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>

const int mod = 998244353;
inline void add(int &x, const int y) {if ((x += y) >= mod) x -= mod;}
struct node {int x, y; inline bool operator < (const node &rhs) const {return y < rhs.y;}} a[22];
int pc[1 << 22 | 1], sum[1 << 22 | 1], high[1 << 11 | 1], f[1 << 22 | 1], g[1 << 22 | 1], n, w, mid;
std::vector<int> a1[1 << 11 | 1], a2[1 << 11 | 1];

int main() {
	scanf("%d%d", &n, &w);
	for (int i = 0; i < n; ++ i) scanf("%d%d", &a[i].x, &a[i].y);
	if (n == 1) return printf("%d %d", a[1].y, 1), 0;
	std::sort(a, a + n), mid = n >> 1;
	for (int i = 0; i < n; ++ i) sum[1 << i] = a[i].x;
	for (int i = 1; i < 1 << n; ++ i) sum[i] = sum[i & i - 1] + sum[i & -i];
	int mx = std::max(mid, n - mid);
	high[0] = -1;
	for (int i = 0; i < 1 << mx; ++ i) for (int j = mx - 1; j >= 0; -- j) if (i & 1 << j) {high[i] = j; break;}
	for (int s = 0; s < 1 << mid; ++ s) {
		for (int s0 = s; s0; s0 = s0 - 1 & s) a1[s].push_back(s0);
		a1[s].push_back(0);
		std::sort(a1[s].begin(), a1[s].end(), [&](const int x, const int y) {return sum[x] > sum[y];});
	}
	for (int s = 1; s < 1 << n - mid; ++ s) {
		for (int s0 = s; s0; s0 = s0 - 1 & s) if (high[s0] < high[s]) a2[s0].push_back(s);
		a2[0].push_back(s);
	}
	for (int s = 0; s < 1 << n - mid; ++ s)
		std::sort(a2[s].begin(), a2[s].end(), [&](const int x, const int y) {return sum[x << mid] < sum[y << mid];});
	memset(f, 0x7f, sizeof f);
	f[0] = 0, g[0] = 1;
	for (int S = 1; S < 1 << mid; ++ S)
	for (int S0 = S & S - 1; ; S0 = S0 - 1 & S) if (high[S] > high[S0]) {
		int cost = a[high[S ^ S0]].y;
		if (f[S0] + cost < f[S]) f[S] = f[S0] + cost, g[S] = g[S0];
		else if (f[S0] + cost == f[S]) add(g[S], g[S0]);
		if (!S0) break;
	}
	for (int S = 0; S < 1 << n; ++ S) {
		int l = S & (1 << mid) - 1, r = S - l >> mid, nf = 1500000000, ng = 0;
		int j = (int)a2[r].size() - 1;
		for (int l0 : a1[l]) {
			while (j >= 0 && sum[(a2[r][j] ^ r) << mid] + sum[l ^ l0] > w) {
				int r0 = a2[r][j], t = l | r0 << mid, cost = a[high[r0 ^ r] + mid].y;
				if (nf + cost < f[t]) f[t] = nf + cost, g[t] = ng;
				else if (nf + cost == f[t]) add(g[t], ng);
				-- j;
			}
			int t = l0 | r << mid;
			if (f[t] < nf) nf = f[t], ng = g[t];
			else if (f[t] == nf) nf = f[t], add(ng, g[t]);
		}
		while (j >= 0) {
			int r0 = a2[r][j], t = l | r0 << mid, cost = a[high[r0 ^ r] + mid].y;
			if (nf + cost < f[t]) f[t] = nf + cost, g[t] = ng;
			else if (nf + cost == f[t]) add(g[t], ng);
			-- j;
		}
	}
	printf("%d %d", f[(1 << n) - 1], g[(1 << n) - 1]);
	return 0;
}