#include <bits/stdc++.h>
using namespace std;
const long long MOD = 998244353;
const long long INF = (1ll<<61)-1;

int main(void){
    //cin.tie(nullptr);
    //ios::sync_with_stdio(false);
    
    long long N,K;
    cin >> N >> K;
    vector<long long> C(N),D(N);
    for(int i=0;i<N;i++){cin >> C[i];}
    for(int i=0;i<N;i++){cin >> D[i];}


    //幸福度がiで満腹度が最大であるような場合の数
    vector<pair<long long,long long>> dp(K+1,{-INF,0});
    dp[0] = {0,1};

    for(int k=0;k<K;k++){
        if(dp[k].first==-INF)continue;
        for(int i=0;i<N;i++){
            if(k+C[i] <= K){
                if(dp[k+C[i]].first == dp[k].first+D[i]){
                    dp[k+C[i]].second = (dp[k+C[i]].second+dp[k].second)%MOD;
                }else if(dp[k+C[i]].first < dp[k].first+D[i]){
                    dp[k+C[i]].first = dp[k].first+D[i];
                    dp[k+C[i]].second = dp[k].second;
                }
            }
        }
    }

    for(int k=K;k>=0;k--){
        if(dp[k].first==-INF)continue;
        cout << dp[k].first << endl << dp[k].second << endl;
        return 0;
    }



    return 0;
}