#include <bits/stdc++.h>
#include <atcoder/modint>
#include <atcoder/convolution>

using namespace atcoder;
using namespace std;
using ll = long long;
using mint = modint998244353;

int main(){

    ll N, K;
    cin >> N >> K;
    vector<ll> 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<pair<ll, mint>> dp(K+1, {-1e18, 0});
    dp[0] = {0, 1};
    for (int i=0; i<=K; i++){
        for (int j=0; j<N; j++){
            if (i-C[j] < 0) continue;
            if (dp[i].first < dp[i-C[j]].first+D[j]){
                dp[i] = dp[i-C[j]];
                dp[i].first += D[j];
            }
            else if (dp[i].first == dp[i-C[j]].first+D[j]){
                dp[i].second += dp[i-C[j]].second;
            }
        }
    }

    ll mx=-1, a;
    mint b, ans;
    for (int i=0; i<=K; i++){
        tie(a, b) = dp[i];
        if (a > mx){
            mx = a;
            ans = b;
        }
    }

    cout << mx << endl;
    cout << ans.val() << endl;

    return 0;
}