#define ATCODER #define _USE_MATH_DEFINES #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; using ll = long long; using ld = long double; using pll = pair; using pdd = pair; //template using pq = priority_queue, greater>; #define FOR(i, a, b) for(ll i=(a); i<(b);i++) #define REP(i, n) for(ll i=0; i<(n);i++) #define ROF(i, a, b) for(ll i=(b-1); i>=(a);i--) #define PER(i, n) for(ll i=n-1; i>=0;i--) #define REPREP(i,j,a,b) for(ll i=0;i > #define VV2(type,n,m,val) vector< vector > val;val.resize(n);for(ll i;i #define VEC(type,n,val) vector val;val.resize(n) #define VL vector #define VVL vector< vector > #define VP vector< pair > #define SZ size() #define all(i) begin(i),end(i) #define SORT(i) sort(all(i)) #define BITI(i) (1<>i) & 1) != 0) #define ALLBIT(n) (ll(1)<v?v:n #define MP(a,b) make_pair(a,b) #define DET2(x1,y1,x2,y2) (x1)*(y2)-(x2)*(y1) #define DET3(x1,y1,z1,x2,y2,z2,x3,y3,z3) (x1)*(y2)*(z3)+(x2)*(y3)*(z1)+(x3)*(y1)*(z2)-(z1)*(y2)*(x3)-(z2)*(y3)*(x1)-(z3)*(y1)*(x2) #define INC(a) for(auto& v:a)v++; #define DEC(a) for(auto& v:a)v--; #define SQU(x) (x)*(x) #define L0 ll(0) #ifdef ATCODER #include using namespace atcoder; using mint = modint1000000007; using mint2 = modint998244353; #endif template vector read(size_t n) { vector ts(n); for (size_t i = 0; i < n; i++) cin >> ts[i]; return ts; } template void read_tuple_impl(TV&) {} template void read_tuple_impl(TV& ts) { get(ts).emplace_back(*(istream_iterator(cin))); read_tuple_impl(ts); } template decltype(auto) read_tuple(size_t n) { tuple...> ts; for (size_t i = 0; i < n; i++) read_tuple_impl(ts); return ts; } using val = ll; using func = pair; val opm(val a, val b) { return min(a, b); } val em() { return 1e18; } val opM(val a, val b) { return max(a, b); } val eM() { return 0; } //val mp(func f, val a) //{ // if (f.first < 0) // return a; // return f; //} //func comp(func f, func g) { // if (g.first < 0) // return f; // return g; //} // //func id() { // return MP(-1, -1); //} ll di[4] = { 1,0,-1,0 }; ll dj[4] = { 0,1,0,-1 }; ll si[4] = { 0,3,3,0 }; ll sj[4] = { 0,0,3,3 }; //ll di[4] = { -1,-1,1,1 }; //ll dj[4] = { -1,1,-1,1 }; ll di8[8] = { 0,-1,-1,-1,0,1,1,1 }; ll dj8[8] = { -1,-1,0,1,1,1,0,-1 }; void solve() { ll n, W; cin >> n >> W; auto [v, w] = read_tuple(n); ll c = 10000; vector dp(n + 1, vector(30001, -1e18)); vector rev(n + 1, vector >>(30001)); vector cv(n + 1, vector(30001, 0)); vector vis(n + 1, vector(30001)); cv[0][c] = 1; vis[0][c] = true; dp[0][c] = 0; REP(i, n) { REP(k, 30001) { if (dp[i + 1][k] < dp[i][k]) { rev[i + 1][k].clear(); rev[i + 1][k].emplace_back(i, k); dp[i + 1][k] = dp[i][k]; } else if (dp[i + 1][k] == dp[i][k]) { rev[i + 1][k].emplace_back(i, k); } if (k + w[i]<0 || k + w[i]>c * 3) { continue; } ll nk = k + w[i]; ll nv = dp[i][k] + v[i]; if (dp[i + 1][nk] < nv) { rev[i + 1][nk].clear(); rev[i + 1][nk].emplace_back(i, k); dp[i + 1][nk] = nv; } else if (dp[i + 1][nk] == nv) { rev[i + 1][nk].emplace_back(i, k); } } } auto dfs = [&](auto self, ll x, ll y) -> mint2 { if (vis[x][y]) { return cv[x][y]; } vis[x][y] = true; mint2 res = 0; for (auto& [nx, ny] : rev[x][y]) { res += self(self, nx, ny); } return cv[x][y] = res; }; ll mx = -1e18; mint2 ans = 0; REP(i, 30001) { if (i > c + W) break; CHMAX(mx, dp[n][i]); } REP(i, 30001) { if (i > c + W) break; if (dp[n][i] == mx) { ans += dfs(dfs, n, i); } } cout << mx << " " << ans.val() << "\n"; return; } int main() { ll t = 1; //cin >> t; while (t--) { solve(); } return 0; }