#include<bits/stdc++.h>
#include<atcoder/modint>
using namespace std;
using mint = atcoder::modint998244353;

int main(){
    int n, k; cin >> n >> k;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i = 0; i < n; i++) cin >> b[i];
    vector<pair<int,mint>> dp(k+1,{-1,0});
    dp[0] = {0,1};
    for (int s = 0; s < k; s++){
        for (int i = 0; i < n; i++){
            int ns = s + a[i];
            if (ns > k) continue;
            int val = dp[s].first + b[i];
            if (dp[ns].first > val) continue;
            if (dp[ns].first == val){
                dp[ns].second += dp[s].second;
            }
            else {
                dp[ns] = {val,dp[s].second};
            }
        }
    }
    int ma = 0;
    mint cnt = 0;
    for (int s = 0; s <= k; s++){
        if (dp[s].first < ma) continue;
        if (dp[s].first == ma){
            cnt += dp[s].second;
        }
        else {
            ma = dp[s].first;
            cnt = dp[s].second;
        }
    }
    cout << ma << endl;
    cout << cnt.val() << endl;
}