#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
using u64 = unsigned long long;
using u32 = unsigned;
const int N = 22;
const int B = 5;
const int mod = 998244353;
int n, w;

struct ob {
	int w, c;
} a[N];
struct pr {
	u32 v; int c;
};

pr operator * (const pr & x, const pr & y) {
	return {x.v + y.v, (u64) x.c * y.c % mod};
}
int norm(int x) {
	return x >= mod ? x - mod : x;
}
void add(int & x, int y) {
	x += y;
	x -= x >= mod ? mod : 0;
}
pr operator + (const pr & x, const pr & y) {
	if(x.v == y.v) {
		return {x.v, norm(x.c + y.c)};
	} else {
		return x.v < y.v ? x : y;
	}
}
void operator += (pr & x, const pr & y) {
	if(y.v < x.v) {
		x = y;
	} else {
		if(y.v == x.v) {
			add(x.c, y.c);
		}
	}
}
pr dp[1 << N];
pr e[1 << N];
int sum[1 << N];
int cc[1 << N];

pr info[1 << B][1 << B];

int main() {
	std::ios::sync_with_stdio(false), cin.tie(0);
	cin >> n >> w;
	for(int i = 0;i < n;++i) {
		cin >> a[i].w >> a[i].c;
	}
	int all = (1 << n) - 1;
	std::sort(a, a + n, [](ob x, ob y) { return x.c < y.c; });
	for(int i = 1;i < 1 << n;++i) {
		sum[i] = sum[i & (i - 1)] + a[__builtin_ctz(i)].w;
		cc[i] = a[std::__lg(i)].c;
		if(sum[i] <= w) {
			e[i] = {(u32)cc[i], 1};
		} else {
			e[i] = {(u32)2e9, 1};
		}
		dp[i] = {(u32) 4e9, 1};
	}
	std::vector<int> subset(1 << B), rank(1 << B);
	for(int i = 0;i < 1 << B;++i) {
		subset[i] = sum[i];
		rank[i] = i;
	}
	sort(subset.begin(), subset.end());
	sort(rank.begin(), rank.end(), [](int x, int y) { return sum[x] < sum[y]; });

	dp[0] = {0u, 1};
	for(int i = 0;i + 1 < 1 << n;++i) {
		int rem = (~i) & all, mask = i;
		int lg = std::__lg(rem);
		rem ^= 1 << lg;
		mask |= 1 << lg;
		if(lg < B) {
			if(dp[i].v >= 2e9) continue;
			for(int j = rem;j;j = (j - 1) & rem) {
				dp[j | mask] = dp[j | mask] + dp[i] * e[j | 1 << lg];
			}
			dp[mask] = dp[mask] + dp[i] * e[1 << lg];
		}
		if(((i + 1) & ((1 << B) - 1)) == 0 && lg >= B) {
			const int high = i >> B << B;
			static pr tmp[1 << B];
			for(int i = 0;i < (1 << B);++i) 
				tmp[i] = {(u32) 2e9, 1};
			for(int i = 0;i < (1 << B);++i) {
				int p = rank[i];
				for(int j = 0;j < (1 << B);++j) {
					if((j & p) == p) {
						auto t = dp[high | (j ^ p)];
						t.v += a[lg].c;
						tmp[j] += t;
					}
				}
				for(int j = 0;j < (1 << B);++j) {
					info[i][j] = tmp[j];
				}
			}
			mask &= ~((1 << B) - 1);
			for(int j = rem;;j = (j - 1) & rem) {
				int rem = w - sum[j | 1 << lg];
				if(rem < 0) continue;
				int index = upper_bound(subset.begin(), subset.end(), rem) - subset.begin() - 1;
				for(int k = 0;k < (1 << B);++k) {
					dp[(j | mask) + k] += info[index][k];
				}
				if(!j) break;
			}
		}
	}
	auto ans = dp[all];
	cout << ans.v << ' ' << ans.c << '\n';
}