/* -*- coding: utf-8 -*-
 *
 * 2429.cc:  No.2429 Happiest Tabehodai Ways - yukicoder
 */

#include<cstdio>
#include<algorithm>
 
using namespace std;

/* constant */

const int MAX_N = 1000;
const int MAX_K = 1000;
const int MOD = 998244353;

/* typedef */

/* global variables */

int cs[MAX_N], ds[MAX_N];
int dp0[MAX_K + 1], dp1[MAX_K + 1];
bool used[MAX_K + 1];

/* subroutines */

inline void addmod(int &a, int b) { a = (a + b) % MOD; }

/* main */

int main() {
  int n, k;
  scanf("%d%d", &n, &k);
  for (int i = 0; i < n; i++) scanf("%d", cs + i);
  for (int i = 0; i < n; i++) scanf("%d", ds + i);

  used[0] = true;
  dp1[0] = 1;

  for (int j = 0; j < k; j++)
    if (used[j])
      for (int i = 0; i < n; i++) {
	int j1 = j + cs[i];
	if (j1 <= k) {
	  if (dp0[j1] < dp0[j] + ds[i]) {
	    used[j1] = true;
	    dp0[j1] = dp0[j] + ds[i];
	    dp1[j1] = dp1[j];
	  }
	  else if (dp0[j1] == dp0[j] + ds[i]) {
	    used[j1] = true;
	    addmod(dp1[j1], dp1[j]);
	  }
	}
      }

  int mxd0 = 0, mxd1 = 0;
  for (int j = 0; j <= k; j++)
    if (used[j]) {
      if (mxd0 < dp0[j]) mxd0 = dp0[j], mxd1 = dp1[j];
      else if (mxd0 == dp0[j]) addmod(mxd1, dp1[j]);
    }

  printf("%d\n%d\n", mxd0, mxd1);
  return 0;
}