#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

const ll MOD = 998244353;

int main() {
  int N, K;
  cin >> N >> K;

  vector<int> C(N);
  vector<int> D(N);
  for (int i = 0; i < N; ++i) {
    cin >> C[i];
  }
  for (int i = 0; i < N; ++i) {
    cin >> D[i];
  }

  ll dp[1010];
  ll dp2[1010];
  memset(dp, 0, sizeof(dp));
  memset(dp2, 0, sizeof(dp2));
  dp2[0] = 1;

  for (int k = 1; k <= K; ++k) {
    dp2[k] = dp2[k - 1];

    for (int i = 0; i < N; ++i) {
      if (k - C[i] >= 0) {
        if (dp[k] < dp[k - C[i]] + D[i]) {
          dp[k] = dp[k - C[i]] + D[i];
          dp2[k] = dp2[k - C[i]];
        } else if (dp[k] == dp[k - C[i]] + D[i]) {
          dp2[k] += dp2[k - C[i]];
        }

        dp[k] %= MOD;
        dp2[k] %= MOD;
      }
    }
  }

  cout << dp[K] << endl;
  cout << dp2[K] << endl;

  return 0;
}