#include<bits/stdc++.h>
#define mod 998244353
using namespace std;
struct apple{
	int w,c;
	bool operator<(const apple &other)const{
		return c>other.c;
	}
}e[25];
int z1[1<<11],z2[1<<11];
int h1[1<<11],h2[1<<11];
struct info{
	int f1,f2;
	info(int f1=0,int f2=0):f1(f1),f2(f2){}
	void operator+=(info in){
		if(f1>in.f1)f1=in.f1,f2=in.f2;
		else if(f1==in.f1)f2=(f2+in.f2)%mod;
	}
}f[1<<11][1<<11];
info operator+(info a,int b){
	a.f1+=b;return a;
}
struct appel{
	int a;info in;
	appel(int a=0,info in=0):a(a),in(in){}
	bool operator<(const appel &other)const{
		return a<other.a;
	}
}e1[3005];
struct appe{
	int a;int b;
	appe(int a=0,int b=0):a(a),b(b){}
	bool operator<(const appe &other)const{
		return a<other.a;
	}
}e2[3005];
int main(){
	int n,W;
	scanf("%d%d",&n,&W);
	for(int i=1;i<=n;++i)scanf("%d%d",&e[i].w,&e[i].c);
	sort(e+1,e+n+1);
	int n1=n>>1,n2=n-n1;
	for(int i=0;i<(1<<n1);++i){
		z1[i]=-1e9;h1[i]=0;
		for(int j=1;j<=n1;++j)if((i>>(j-1))&1){
			h1[i]+=e[j].w;z1[i]=max(z1[i],e[j].c);
		}
	}
	for(int i=0;i<(1<<n2);++i){
		z2[i]=-1e9;h2[i]=0;
		for(int j=1;j<=n2;++j)if((i>>(j-1))&1){
			h2[i]+=e[n1+j].w;z2[i]=max(z2[i],e[n1+j].c);
		}
	}
	info dd;dd.f1=1e9,dd.f2=0;
	for(int i=0;i<(1<<n1);++i)for(int j=0;j<(1<<n2);++j)
		f[i][j]=dd;
	f[0][0].f1=0,f[0][0].f2=1;
	for(int i=1;i<(1<<n2);++i){
		for(int j=i;j;j=(j-1)&i){
			if(__builtin_ctz(i)==__builtin_ctz(j)){
				if(h2[j]<=W)f[0][i]+=f[0][i^j]+z2[j];
			}
		}
	}
	for(int i=1;i<(1<<n1);++i)for(int ii=0;ii<(1<<n2);++ii){
		int t1=0,t2=0;
		for(int j=i;j;j=(j-1)&i){
			if(__builtin_ctz(i)==__builtin_ctz(j)&&h1[j]<=W){
				info nf=f[i^j][ii]+z1[j];
				e1[++t1]=appel(h1[j],nf);
			}
		}
		int i2=((1<<n2)-1)^ii;
		for(int j=i2;;j=(j-1)&i2){
			if(h2[j]<=W){
				e2[++t2]=appe(W-h2[j],j);
			}
			if(!j)break;
		}
		sort(e1+1,e1+t1+1);
		sort(e2+1,e2+t2+1);
		int w=1;
		info cs(1e9,0);
		for(int z=1;z<=t2;++z){
			while(w<=t1&&e1[w].a<=e2[z].a){
				cs+=e1[w++].in;
			}
			f[i][ii|e2[z].b]+=cs;
		}
	}
	info ff=f[(1<<n1)-1][(1<<n2)-1];
	printf("%d %d\n",ff.f1,ff.f2);
	return 0;
}