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



const ll mod = 998'244'353;
//const ll mod = 1'000'000'007;
//const ll mod = 67'280'421'310'721;
struct mint{
    long long x;
    mint(long long x=0):x((x%mod+mod)%mod){}
    mint operator-() const{
        return mint(-x);
    }
    mint& operator+=(const mint& a){
        if((x+=a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator-=(const mint& a){
        if((x+=mod-a.x)>=mod)x-=mod;
        return *this;
    }
    mint& operator*=(const  mint& a){
        (x *= a.x) %= mod;
        return *this;
    }
    mint operator+(const mint& a) const{
        mint res(*this);
        return res+=a;
    }
    mint operator-(const mint& a) const{
        mint res(*this);
        return res-=a;
    }
    mint operator*(const mint& a) const{
        mint res(*this);
        return res*=a;
    }
    mint pow(long long n) const {
        assert(0 <= n);
        mint a = *this, r = 1;
        while (n) {
            if (n & 1) r *= a;
            a *= a;
            n >>= 1;
        }
        return r;
    }
    mint inv() const{
        return pow(mod-2);
    }
    mint& operator/=(const mint& a){
        return (*this)*=a.inv();
    }
    mint operator/(const mint& a) const {
        mint res(*this);
        return res/=a;
    }
    friend ostream& operator<<(ostream& os, const mint& m){
        os << m.x;
        return os;
    }
    bool operator==(const mint& a) const {
        return x == a.x;
    }
    bool operator<(const mint& a) const{
        return x < a.x;
    }
};

int main(){
    int n,k;
    cin>>n>>k;
    vector<int> c(n),d(n);
    for(int i = 0;i<n;i++) cin>>c[i];
    for(int i = 0;i<n;i++) cin>>d[i];
    vector<mint> dp(k+1,0);
    vector<ll> ndp(k+1,0);
    dp[0] = 1;
    for(int i = 0;i<=k;i++){
        for(int j = 0;j<n;j++){
            ll nxt = i + c[j];
            if(nxt>k) continue;
            ll now = ndp[i] + d[j];
            if(ndp[nxt]<now){
                ndp[nxt] = now;
                dp[nxt] = dp[i];
            }else if(ndp[nxt]==now){
                dp[nxt] += dp[i];
            }
        }
    }
    ll mx =0;
    for(int i = 0;i<=k;i++) mx = max(mx,ndp[i]);
    mint ans = 0;
    for(int i = 0;i<=k;i++) if(ndp[i]==mx) ans += dp[i];
    cout<<mx<<endl;
    cout<<ans<<endl;
}