#include<bits/stdc++.h>
#define L(i, j, k) for(int i = (j); i <= (k); ++i)
#define R(i, j, k) for(int i = (j); i >= (k); --i)
#define ll long long
#define sz(a) ((int) (a).size())
#define vi vector < int >
#define me(a, x) memset(a, x, sizeof(a))
#define ull unsigned long long
#define ld __float128
#define pb emplace_back
using namespace std;
const int N = 1 << 22, mod = 998244353;
const int M = 25;
int n, W;
int w[M], c[M]; 
int vis[N];
int subw[N], subc[N];
int ok[N];

int dp[N][M];
int ndp[N];
int fw[N][M];

int f[M];

ull D[M];

void Add(int &x, int y){
	x = x + y >= mod ? x + y - mod : x + y;
}
void Dec(int &x, int y){
	x = x >= y ? x - y : x - y + mod;
}

int ds[N];
int fan[N];
int main() {
	ios :: sync_with_stdio(false);
	cin.tie(0); cout.tie(0);
	cin >> n >> W;
	L(i, 0, n - 1) 
		cin >> w[i] >> c[i];
//	n = 22, W = 5;
//	L(i, 0, n - 1) 
//		w[i] = 1, c[i] = 1;
	L(i, 0, n - 1) 
		L(j, i + 1, n - 1) 
			if(c[i] > c[j]) 
				swap(w[i], w[j]), swap(c[i], c[j]);
	L(p, 0, n - 1) {
		L(i, 0, (1 << p) - 1) {
			subw[i + (1 << p)] = subw[i] + w[p];
			subc[i + (1 << p)] = subc[i] + c[p];
		}
	}
	L(i, 0, (1 << n) - 1) {
		ok[i] = subw[i] <= W; 
	}
	L(i, 0, (1 << n) - 1) 
		dp[i][0] = 1;
	int hb = min(n, 18);
	R(p, n - 1, hb) {
		L(s, 0, (1 << p) - 1) {
			me(fw[s], 0);
			if(ok[s + (1 << p)]) {
				fw[s][__builtin_popcount(s) + 1] = 1;
			}
		}
		L(d, 0, p - 1) {
			for(int i = 0; i < (1 << p); i += (1 << (d + 1))) {
				L(j, i, i + (1 << d) - 1) 
					L(k, 0, p) 
						Add(fw[j + (1 << d)][k], fw[j][k]);
			}
		}
		for(int i = 0; i < (1 << n); i += (1 << (p + 1))) {
			L(j, i, i + (1 << p) - 1) {
				L(k, 0, n) 
					Dec(dp[j + (1 << p)][k], dp[j][k]);
				int pos = j - i;
				L(u, 0, n) 
					L(v, 0, n - u)
						D[u + v] += (ull) dp[j][u] * fw[pos][v];
				L(i, 0, n) dp[j][i] = D[i] % mod;
				L(i, 0, n) D[i] = 0;
			}
		}
	}
	L(p, 0, hb - 1) 
		for(int i = 0; i < (1 << n); i += (1 << (p + 1)))
			L(j, i, i + (1 << p) - 1) 
				L(k, 0, n) 
					Dec(dp[j + (1 << p)][k], dp[j][k]);
	L(i, 0, (1 << hb) - 1) 
		ds[i] = 2e9, fan[i] = 0;
	int nao = 0;
	L(i, hb, n - 1) 
		nao += c[i];
	for(int i = 0; i < (1 << n); i += (1 << hb)) {
		int v = nao - subc[i];
		for(int j = 0; j < (1 << hb); ++j) {
			int pc = __builtin_popcount(j);
			if(dp[i + j][pc + n - hb]) {
				if(v < ds[j]) {
					ds[j] = v, fan[j] = dp[i + j][pc + n - hb];
				} else if(v == ds[j]) {
					Add(fan[j], dp[i + j][pc + n - hb]);
				}
			}
		}
	}
	R(p, hb - 1, 0) {
		L(i, 0, (1 << p) - 1) {
			int s = (1 << p) - i - 1;
			for(int cur = s; ; cur = (cur - 1) & s) if(ok[cur + (1 << p)]) {
				int go = i + cur + (1 << p);
				if(ds[go] > ds[i] + c[p]) {
					ds[go] = ds[i] + c[p];
					fan[go] = fan[i];
				} else if(ds[go] == ds[i] + c[p]) {
					Add(fan[go], fan[i]);
				}
				if(!cur)break;
			}
		}
		L(i, 0, (1 << p) - 1) {
			fan[i] = fan[i + (1 << p)];
			ds[i] = ds[i + (1 << p)];
		}
	}
	cout << ds[0] << ' ' << fan[0] << '\n';
	return 0;
} 
/*
5 5
3 5
1 4
2 3
2 2
2 1
*/