#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
const int N = 23,Sz = 1 << 22,Sm = 1 << 12,P = 998244353;
int n,V;
struct node { int w,c;} p[N];
int sum[Sz],lb[Sz];
struct Data {
	int v,s;
	Data(){v = 1.5e9;s = 0;}
	Data(const int _v,const int _s):v(_v),s(_s){}
	Data operator + (const int &rhs) const { return Data(v + rhs,s);}
	Data operator * (const Data &rhs) const { 
		if(v < rhs.v) return *this;
		if(v > rhs.v) return rhs;
		return Data(v,(s + rhs.s) % P);
	}
	Data& operator *= (const Data &rhs) {
		if(v > rhs.v) *this = rhs;
		else if(v == rhs.v) { s += rhs.s;if(s >= P) s -= P;}
		return *this;
	}
};
Data dp[Sz];
vector<int> sp1[Sm],sp2[Sm];
Data pmn[Sm];
int main() {
	cin >> n >> V;
	for(int i = 0;i < n;i++) cin >> p[i].w >> p[i].c;
	// int st = clock();
	sort(p,p + n,[&](const node &a,const node &b) { return a.c > b.c;});
	int mid = n / 2,all = (1 << n);
	for(int i = 0;i < n;i++) sum[1 << i] = p[i].w;
	for(int i = 0;i < all;i++) sum[i] = sum[i & (i - 1)] + sum[i & (-i)];
	for(int i = 0;i < all;i++) lb[i] = __lg(i & (-i));
	// for(int i = 0;i < all;i++) if(sum[i] <= V) dp[i] = Data(p[lb[i]].c,1);
	for(int i = 0;i < (1 << mid);i++) {
		for(int j = i;j;j = (j - 1) & i)
			if(j != i) sp1[i].push_back(j);
		sp1[i].push_back(0);
		sort(sp1[i].begin(),sp1[i].end(),[&](const int &x,const int &y) { return sum[x] > sum[y];});
	}
	for(int i = 0;i < (1 << n - mid);i++) {
		for(int j = i;j < (1 << n - mid);j = (j + 1) | i)
			sp2[i].push_back(j << mid);
		sort(sp2[i].begin(),sp2[i].end(),[&](const int &x,const int &y) { return sum[x] > sum[y];});
	}
	dp[0] = Data(0,1);
	for(int i = 1;i < all;i++) 
		if(!(i & ((1 << mid) - 1)))
			for(int j = i;j;j = (j - 1) & i)
				if(((j >> lb[i]) & 1) && sum[j] <= V)
					dp[i] *= (dp[i - j] + p[lb[i]].c);
	for(int i = 0;i < all;i++) {  // i 的左半边为等待更新的集合，i 的右半边为更新超集的集合
		int L = i & ((1 << mid) - 1),R = i >> mid;
		if(!L) continue;
		int len = sp2[R].size();
		for(int j = 0;j < len;j++) pmn[j].v = 1.5e9,pmn[j].s = 0; // 可行的是一段后缀
		for(int p1 = 0,p2 = 0;p1 < sp1[L].size();++p1) {
			while(p2 < len && sum[sp2[R][p2]] - sum[R << mid] + sum[L] - sum[sp1[L][p1]] > V) ++p2;
			if(p2 < len)
				pmn[p2] *= dp[(R << mid) | sp1[L][p1]];
		}
		for(int i = 1;i < len;i++) pmn[i] *= pmn[i - 1];
		for(int i = 0;i < len;i++)
			dp[sp2[R][i] | L] *= (pmn[i] + p[lb[L]].c);
	}
	printf("%d\n%d\n",dp[all - 1].v,dp[all - 1].s);
	// int ed = clock();
	// cerr << (ed - st) * 1.0 / CLOCKS_PER_SEC << endl;
	return 0;
}
/*
22 10000000
956231 904623
1692946 1796774
1081323 1170319
3218792 2542661
3183376 3037270
1869132 1442561
35436 35018
1564635 1939950
1847344 2006043
755870 899310
1671882 2057413
1369264 1338951
3132483 3504034
2056224 1825640
1840949 1562071
1514040 1405352
2300821 2421801
2466540 3004920
1514040 1405352
1369264 1338951
35436 35018
1369264 1338951
*/