#include <bits/stdc++.h>
using namespace std;
const int N=11;
const int mod=998244353;
void add(int &x,int y){
    if((x+=y)>=mod)x-=mod;
}
struct info{
    int x,t;
    string str(){
        return "("+to_string(x)+","+to_string(t)+")";
    }
};
info& operator+=(info &x,const info y){
    if(y.x<x.x)x=y;
    else if(y.x==x.x)add(x.t,y.t);
    return x;
}
info operator+(info x,const int y){
    x.x+=y;
    return x;
}
info dp[1<<N][1<<N];
int a1[N],b1[N];
int a2[N],b2[N];
int suma1[1<<N],suma2[1<<N];
int sumb1[1<<N],sumb2[1<<N];
vector<int> ve1[1<<N],ve2[1<<N];
int main()
{
    int n,w;cin>>n>>w;
    vector<pair<int,int>> p(n);
    for(int i=0;i<n;i++)cin>>p[i].second>>p[i].first;
    sort(p.begin(),p.end());
    reverse(p.begin(),p.end());
    if(n==1){
        cout<<p[0].first<<" "<<1<<"\n";
        return 0;
    }
    int m=n/2;
    n-=m;
    for(int i=0;i<n;i++)a1[i]=p[i].second,b1[i]=p[i].first;
    for(int i=0;i<m;i++)a2[i]=p[i+n].second,b2[i]=p[i+n].first;
    for(int i=0;i<(1<<n);i++)
        for(int j=0;j<(1<<m);j++)dp[i][j]={(int)2e9,0};
    assert(__lg(4)==2);
    for(int i=1;i<(1<<n);i++)suma1[i]=suma1[i^(1<<__builtin_ctz(i))]+a1[__builtin_ctz(i)],sumb1[i]=b1[__builtin_ctz(i)];
    for(int i=1;i<(1<<m);i++)suma2[i]=suma2[i^(1<<__builtin_ctz(i))]+a2[__builtin_ctz(i)],sumb2[i]=b2[__builtin_ctz(i)];
    dp[0][0]={0,1};
    for(int i=1;i<(1<<m);i++){
        for(int j=i;j;j=(j-1)&i)if(suma2[j]<=w){
            dp[0][i]+=dp[0][i^j]+sumb2[j];
        }
    }
    for(int i=0;i<(1<<n);i++){
        ve1[i].push_back(0);
        for(int j=i;j;j=(j-1)&i)if(suma1[j^i]<=w){
            ve1[i].push_back(j);
        }
        sort(ve1[i].begin(),ve1[i].end(),[&](int x,int y){
            return suma1[x^i]<suma1[y^i];
        });
        
    }
    for(int i=0;i<(1<<m);i++){
        int p=((1<<m)-1)^i;
        ve2[i].push_back(i);
        for(int j=p;j;j=(j-1)&p)if(suma2[j]<=w){
            ve2[i].push_back(j^i);
        }
        sort(ve2[i].begin(),ve2[i].end(),[&](int x,int y){
            return suma2[x^i]>suma2[y^i];
        });
    }  
    for(int i=1;i<(1<<n);i++){
        for(int j=0;j<(1<<m);j++){
            info mi={(int)2e9,1};
            auto it1=ve1[i].begin();
            auto it2=ve2[j].begin();
            while(it2!=ve2[j].end()&&suma1[(*it1)^i]+suma2[(*it2)^j]>w)it2++;
            for(;it2!=ve2[j].end();it2++){
                while(it1!=ve1[i].end()&&suma1[(*it1)^i]+suma2[(*it2)^j]<=w){
                    // cout<<dp[*it1][j].x<<" "<<sumb1[(*it1)^i]<<endl;
                    mi+=dp[*it1][j]+sumb1[(*it1)^i];
                    it1++;
                }
                if(*it2!=j)dp[i][*it2]+=mi;
                // cout<<"i="<<i<<" j="<<j<<" it1="<<*it1<<" *it2="<<*it2<<" mi="<<mi.str()<<endl;
            }
            // cout<<"i="<<i<<" j="<<j<<" ("<<dp[i][j].x<<","<<dp[i][j].t<<")"<<endl;
        }
    }
    cout<<dp[(1<<n)-1][(1<<m)-1].x<<" ";
    cout<<dp[(1<<n)-1][(1<<m)-1].t<<"\n";
    return 0;
}