#include <bits/stdc++.h>
using namespace std;

long long mod = 998244353;
//入力が必ず-mod<a<modの時.
struct mint{
    long long v = 0;
    mint(){} mint(int a){v = a<0?a+mod:a;} mint(long long a){v = a<0?a+mod:a;}
    mint(unsigned long long a){v = a;}
    long long val(){return v;}
    void modu(){v %= mod;}
 
    mint repeat2mint(const long long a,long long b){
        mint ret = 1,p = a;
        while(b){
            if(b&1) ret *= p;
            p *= p; b >>= 1;
        }
        return ret;
    };
 
    mint &operator=(const mint &b) = default;
    mint operator-() const {return mint(0)-(*this);}
    mint operator+(const mint b){return mint(v)+=b;}
    mint operator-(const mint b){return mint(v)-=b;}
    mint operator*(const mint b){return mint(v)*=b;}
    mint operator/(const mint b){return mint(v)/=b;}
 
    mint operator+=(const mint b){
        v += b.v; if(v >= mod) v -= mod;
        return *this;
    }
    mint operator-=(const mint b){
        v -= b.v; if(v < 0) v += mod; 
        return *this;
    }   
    mint operator*=(const mint b){v = v*b.v%mod; return *this;}
    mint operator/=(mint b){
        if(b == 0) assert(false);
        int left = mod-2;
        while(left){if(left&1) *this *= b; b *= b; left >>= 1;}
        return *this;
    }
 
    mint operator++(int){*this += 1; return *this;}
    mint operator--(int){*this -= 1; return *this;}
    bool operator==(const mint b){return v == b.v;}
    bool operator!=(const mint b){return v != b.v;}
    bool operator>(const mint b){return v > b.v;}
    bool operator>=(const mint b){return v >= b.v;}
    bool operator<(const mint b){return v < b.v;}
    bool operator<=(const mint b){return v <= b.v;}
 
    mint pow(const long long x){return repeat2mint(v,x);}
    mint inv(){return mint(1)/v;}
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    int N,W; cin >> N >> W;

    vector<vector<pair<int,mint>>> dp(N+1,vector<pair<int,mint>>(20009,{-1001001001,0}));
    auto update = [&](pair<int,mint> &a,pair<int,mint> &b,int v) -> void {
        if(b.first+v == a.first) a.second += b.second;
        else if(b.first+v > a.first) a = {b.first+v,b.second};
    };
    int zero = 10000;
    vector<pair<int,int>> WV(N);
    for(auto &[w,v] : WV) cin >> v >> w;
    sort(WV.begin(),WV.end());

    dp.at(0).at(zero) = {0,1};
    for(int i=0; i<N; i++){
        auto [w,v] = WV.at(i);
        for(int k=0; k<20009; k++){
            if(dp.at(i).at(k).second == 0) continue;
            update(dp.at(i+1).at(k),dp.at(i).at(k),0);
            if(k+w < 0) continue;
            if(k+w > 20009) continue;
            update(dp.at(i+1).at(k+w),dp.at(i).at(k),v);
        }
    }
    pair<int,mint> ans = {-1001001001,0};
    for(int i=0; i<=zero+W; i++) update(ans,dp.at(N).at(i),0);
        
    cout << ans.first << " " << ans.second.v << endl;
}