#include<bits/stdc++.h>
#define fr(i,j,k) for(register int i=j;i<=k;++i)
#define rf(i,j,k) for(register int i=j;i>=k;--i)
#define foredge(i,j) for(register int i=head[j];i;i=e[i].nxt)
#define pb push_back
#define pii pair<int,int>
#define mp make_pair
#define Times printf("Time:%.3lf\n",clock()/CLOCKS_PER_SEC)
using namespace std;
inline int read(){
	int x=0;
	bool f=0;
	char c=getchar();
	while(!isdigit(c)) f|=(c=='-'),c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return f?-x:x;
}
inline void write(int x){
    if(x<0){putchar('-');x=-x;}
    if(x>9)write(x/10);
    putchar(x%10+'0');
}
inline void writeln(int x){write(x); puts("");}
inline void writepl(int x){write(x); putchar(' ');}
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int randfind(int l,int r){return rnd()%(r-l+1)+l;}
//inline void init(){
//	int t=read();
//	while(t--) work();
//}
const int Maxn=(1<<11)+10,mod=998244353,inf=2.1e9;
inline void add(int &x,int y){
    x+=y;if(x>=mod) x-=mod;
}
int n,m;
int lim;
int s1[Maxn],val1[Maxn],s2[Maxn],val2[Maxn];
struct node{
    int minn,s;
}f[Maxn][Maxn];
inline node update(node x,node y){
    node sum;sum.minn=min(x.minn,y.minn);sum.s=0;
    if(x.minn==sum.minn) add(sum.s,x.s);if(y.minn==sum.minn) add(sum.s,y.s);
    return sum;
}
int N1,N2;
int a[Maxn],b[Maxn];
inline void init(){
    n=read();m=read();lim=(n/2);
    N1=(1<<lim)-1;N2=(1<<(n-lim))-1;
    vector<pii> now;
    fr(i,1,n){int x,y;x=read();y=read();now.pb(mp(y,x));}
    sort(now.begin(),now.end());reverse(now.begin(),now.end());fr(i,1,n) a[i]=now[i-1].second,b[i]=now[i-1].first;
    // fr(i,1,n) cout<<a[i]<<' '<<b[i]<<endl;
}
inline int lowbit(int x){return x&(-x);}
vector<int> vc1[Maxn],vc2[Maxn];
inline bool cmp1(int a,int b){return s1[a]>s1[b];}
inline bool cmp2(int a,int b){return s2[a]>s2[b];}
inline void work(){
    fr(i,1,lim) s1[1<<(i-1)]=a[i],val1[1<<(i-1)]=b[i];
    fr(i,1,N1){
        int id=lowbit(i);int x=i^id;
        if(x) s1[i]=s1[x]+s1[id],val1[i]=max(val1[x],val1[id]);
    }
    fr(i,1,n-lim) s2[1<<(i-1)]=a[i+lim],val2[1<<(i-1)]=b[i+lim];
    fr(i,1,N2){
        int id=lowbit(i);int x=i^id;
        if(x) s2[i]=s2[x]+s2[id],val2[i]=max(val2[x],val2[id]);
    }
    fr(S,0,N1){
        for(int T=(S+1)|S;T<=N1;T=(T+1)|S) if(T&lowbit(N1^S)) vc1[S].push_back(T);
        sort(vc1[S].begin(),vc1[S].end(),cmp1);
    }
    fr(S,0,N2){
        for(int T=S;;T=(T-1)&S){vc2[S].push_back(T);if(!T) break;}
        sort(vc2[S].begin(),vc2[S].end(),cmp2);
    }
    fr(i,0,N1) fr(j,0,N2) f[i][j].minn=inf;f[0][0]=(node){0,1};
    fr(i,0,N1) fr(j,0,N2){
        if(i==N1 && j==N2) break;
        if(i==N1 && f[i][j].minn!=inf){
            for(int T=(j+1)|j;T<=N2;T=(T+1)|j) if(s2[T^j]<=m && (T&lowbit(N2^j))) f[i][T]=update(f[i][T],(node){f[i][j].minn+val2[T^j],f[i][j].s});
        }
        node ans;ans.minn=inf;
        int l=0;
        for(auto x:vc1[i]){
            while(l<vc2[j].size() && s2[vc2[j][l]^j]+s1[i^x]<=m){
                ans=update(ans,f[i][vc2[j][l]]);++l;
            }
            // cout<<i<<' '<<j<<' '<<x<<' '<<ans.minn+val1[x^i]<<' '<<ans.s<<endl;
            if(ans.minn!=inf) f[x][j]=update(f[x][j],(node){ans.minn+val1[x^i],ans.s});
        }
    }
    writepl(f[N1][N2].minn),writeln(f[N1][N2].s);
}
signed main(){
	// freopen("input.in","r",stdin);
	// freopen("output.out","w",stdout);
    init();work();
    // printf("\nTIME:%.3lf",(double)clock()/CLOCKS_PER_SEC);
	return 0;
}