#ifndef HIDDEN_IN_VS // 折りたたみ用 // 警告の抑制 #define _CRT_SECURE_NO_WARNINGS // ライブラリの読み込み #include using namespace std; // 型名の短縮 using ll = long long; // -2^63 ~ 2^63 = 9 * 10^18(int は -2^31 ~ 2^31 = 2 * 10^9) using pii = pair; using pll = pair; using pil = pair; using pli = pair; using vi = vector; using vvi = vector; using vvvi = vector; using vvvvi = vector; using vl = vector; using vvl = vector; using vvvl = vector; using vvvvl = vector; using vb = vector; using vvb = vector; using vvvb = vector; using vc = vector; using vvc = vector; using vvvc = vector; using vd = vector; using vvd = vector; using vvvd = vector; template using priority_queue_rev = priority_queue, greater>; using Graph = vvi; // 定数の定義 const double PI = acos(-1); const vi DX = { 1, 0, -1, 0 }; // 4 近傍(下,右,上,左) const vi DY = { 0, 1, 0, -1 }; int INF = 1001001001; ll INFL = 4004004003104004004LL; // (int)INFL = 1010931620; double EPS = 1e-15; // 入出力高速化 struct fast_io { fast_io() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(18); } } fastIOtmp; // 汎用マクロの定義 #define all(a) (a).begin(), (a).end() #define sz(x) ((int)(x).size()) #define lbpos(a, x) (int)distance((a).begin(), std::lower_bound(all(a), x)) #define ubpos(a, x) (int)distance((a).begin(), std::upper_bound(all(a), x)) #define Yes(b) {cout << ((b) ? "Yes\n" : "No\n");} #define rep(i, n) for(int i = 0, i##_len = int(n); i < i##_len; ++i) // 0 から n-1 まで昇順 #define repi(i, s, t) for(int i = int(s), i##_end = int(t); i <= i##_end; ++i) // s から t まで昇順 #define repir(i, s, t) for(int i = int(s), i##_end = int(t); i >= i##_end; --i) // s から t まで降順 #define repe(v, a) for(const auto& v : (a)) // a の全要素(変更不可能) #define repea(v, a) for(auto& v : (a)) // a の全要素(変更可能) #define repb(set, d) for(int set = 0; set < (1 << int(d)); ++set) // d ビット全探索(昇順) #define repp(a) sort(all(a)); for(bool a##_perm = true; a##_perm; a##_perm = next_permutation(all(a))) // a の順列全て(昇順) #define smod(n, m) ((((n) % (m)) + (m)) % (m)) // 非負mod #define uniq(a) {sort(all(a)); (a).erase(unique(all(a)), (a).end());} // 重複除去 #define EXIT(a) {cout << (a) << endl; exit(0);} // 強制終了 #define inQ(x, y, u, l, d, r) ((u) <= (x) && (l) <= (y) && (x) < (d) && (y) < (r)) // 半開矩形内判定 // 汎用関数の定義 template inline ll pow(T n, int k) { ll v = 1; rep(i, k) v *= n; return v; } template inline bool chmax(T& M, const T& x) { if (M < x) { M = x; return true; } return false; } // 最大値を更新(更新されたら true を返す) template inline bool chmin(T& m, const T& x) { if (m > x) { m = x; return true; } return false; } // 最小値を更新(更新されたら true を返す) template inline T get(T set, int i) { return (set >> i) & T(1); } // 演算子オーバーロード template inline istream& operator>>(istream& is, pair& p) { is >> p.first >> p.second; return is; } template inline istream& operator>>(istream& is, vector& v) { repea(x, v) is >> x; return is; } template inline vector& operator--(vector& v) { repea(x, v) --x; return v; } template inline vector& operator++(vector& v) { repea(x, v) ++x; return v; } #endif // 折りたたみ用 #if __has_include() #include using namespace atcoder; #ifdef _MSC_VER #include "localACL.hpp" #endif //using mint = modint1000000007; using mint = modint998244353; //using mint = modint; // mint::set_mod(m); namespace atcoder { inline istream& operator>>(istream& is, mint& x) { ll x_; is >> x_; x = x_; return is; } inline ostream& operator<<(ostream& os, const mint& x) { os << x.val(); return os; } } using vm = vector; using vvm = vector; using vvvm = vector; using vvvvm = vector; #endif #ifdef _MSC_VER // 手元環境(Visual Studio) #include "local.hpp" #else // 提出用(gcc) inline int popcount(int n) { return __builtin_popcount(n); } inline int popcount(ll n) { return __builtin_popcountll(n); } inline int lsb(int n) { return n != 0 ? __builtin_ctz(n) : -1; } inline int lsb(ll n) { return n != 0 ? __builtin_ctzll(n) : -1; } inline int msb(int n) { return n != 0 ? (31 - __builtin_clz(n)) : -1; } inline int msb(ll n) { return n != 0 ? (63 - __builtin_clzll(n)) : -1; } inline int msb(__int128 n) { return (n >> 64) != 0 ? (127 - __builtin_clzll((ll)(n >> 64))) : n != 0 ? (63 - __builtin_clzll((ll)(n))) : -1; } #define gcd __gcd #define dump(...) #define dumpel(v) #define dump_list(v) #define dump_mat(v) #define input_from_file(f) #define output_to_file(f) #define Assert(b) { if (!(b)) while (1) cout << "OLE"; } #endif int main() { // input_from_file("input.txt"); // output_to_file("output.txt"); int n, k; cin >> n >> k; vi c(n), d(n); cin >> c >> d; vector> res(k + 1, { -INF, 0 }); dump(res); vector> pow2(k + 1, { -INF, 0 }); rep(i, n) { if (c[i] > k) continue; auto [deg, coef] = pow2[c[i]]; if (deg < d[i]) pow2[c[i]] = { d[i], 1 }; else if (deg == d[i]) pow2[c[i]] = { deg, coef + 1 }; } dump(pow2); vector> sumpow2(k + 1, { -INF, 0 }); sumpow2[0] = { 0, 1 }; dump(sumpow2); // pow2 = r^(2^i), sumpow2 = 1 + r + ... + r^((2^i) - 1) int m = k + 1; while (m > 0) { if (m & 1) { vector> nres(k + 1, { -INF, 0 }); repi(i1, 0, k) { auto [deg1, coef1] = res[i1]; repi(i2, 0, k - i1) { auto [deg2, coef2] = pow2[i2]; auto [deg, coef] = nres[i1 + i2]; int ndeg = deg1 + deg2; mint ncoef = coef1 * coef2; if (deg < ndeg) nres[i1 + i2] = { ndeg, ncoef }; else if (deg == ndeg) nres[i1 + i2] = { deg, coef + ncoef }; } } repi(i, 0, k) { auto [deg, coef] = nres[i]; auto [deg2, coef2] = sumpow2[i]; if (deg < deg2) nres[i] = { deg2, coef2 }; else if (deg == deg2) nres[i] = { deg, coef + coef2 }; } res = move(nres); } vector> nsumpow2(k + 1, { -INF, 0 }); repi(i1, 0, k) { auto [deg1, coef1] = sumpow2[i1]; repi(i2, 0, k - i1) { auto [deg2, coef2] = pow2[i2]; auto [deg, coef] = nsumpow2[i1 + i2]; int ndeg = deg1 + deg2; mint ncoef = coef1 * coef2; if (deg < ndeg) nsumpow2[i1 + i2] = { ndeg, ncoef }; else if (deg == ndeg) nsumpow2[i1 + i2] = { deg, coef + ncoef }; } } repi(i, 0, k) { auto [deg, coef] = nsumpow2[i]; auto [deg2, coef2] = sumpow2[i]; if (deg < deg2) nsumpow2[i] = { deg2, coef2 }; else if (deg == deg2) nsumpow2[i] = { deg, coef + coef2 }; } sumpow2 = move(nsumpow2); vector> npow2(k + 1, { -INF, 0 }); repi(i1, 0, k) { auto [deg1, coef1] = pow2[i1]; repi(i2, 0, k - i1) { auto [deg2, coef2] = pow2[i2]; auto [deg, coef] = npow2[i1 + i2]; int ndeg = deg1 + deg2; mint ncoef = coef1 * coef2; if (deg < ndeg) npow2[i1 + i2] = { ndeg, ncoef }; else if (deg == ndeg) npow2[i1 + i2] = { deg, coef + ncoef }; } } pow2 = move(npow2); m /= 2; dump(res); } int deg_max = -INF; mint cnt = 0; repi(i, 0, k) { auto [deg, coef] = res[i]; if (deg == deg_max) cnt += coef; else if (deg > deg_max) { cnt = coef; deg_max = deg; } } if (deg_max == INF) { deg_max = 0; cnt = 1; } cout << deg_max << endl; cout << cnt << endl; }