#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;
using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
using mint = modint998244353;
const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,mint>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	vector<int>c(n), d(n);
	rep(i, n)cin >> c[i];
	rep(i, n)cin >> d[i];
	vector<int>dp(k + 1, -INF);
	dp[0] = 0;// colに対するmax味
	rep(i, k + 1)rep(j, n) {
		if (-INF == dp[i])continue;
		int ni = i + c[j];
		if (ni > k)continue;
		chmax(dp[ni], dp[i] + d[j]);
	}
	int mx = 0;
	rep(i, k + 1)chmax(mx, dp[i]);
	//rep(i, k + 1) {
	//	cout << dp[i] << " ";
	//}cout << endl;
	vector<mint>dp2(k + 1);
	dp2[0] = 1;
	rep(i, k + 1) {
		rep(j, n) {
			int ni = i + c[j];
			if (ni > k)continue;
			if (dp[ni] != dp[i] + d[j])continue;
			dp2[ni] += dp2[i];
		}
		//rep(j, k + 1) {
		//	cout << dp2[j].val() << " ";
		//}cout << endl;
	}
	mint ans = 0;
	rep(i, k + 1)if (mx == dp[i])ans += dp2[i];
	cout << mx << endl;
	cout << ans.val() << endl;
	return 0;
}