/* -*- coding: utf-8 -*-
 *
 * 2866.cc:  No.2866 yuusaan's Knapsack - yukicoder
 */

#include<cstdio>
#include<algorithm>
#include<utility>

using namespace std;

/* constant */

const int MAX_N = 100;
const int MIN_W = -10000;
const int MAX_W = 10000;
const int M = MAX_W - MIN_W + 1;
const int MOD = 998244353;
const int INF = 1 << 30;

/* typedef */

using pii = pair<int,int>;

/* global variables */

pii wvs[MAX_N];
int dp0[2][M], dp1[2][M];

/* subroutines */

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

/* main */

int main() {
  int n, w;
  scanf("%d%d", &n, &w);
  for (int i = 0; i < n; i++) {
    int v, w;
    scanf("%d%d", &v, &w);
    wvs[i] = {w, v};
  }
  sort(wvs, wvs + n);

  fill(dp0[0], dp0[0] + M, -INF);
  dp0[0][-MIN_W] = 0, dp1[0][-MIN_W] = 1;
  int cur = 0, nxt = 1;

  for (int i = 0; i < n; i++) {
    auto [wi, vi] = wvs[i];
    copy(dp0[cur], dp0[cur] + M, dp0[nxt]);
    copy(dp1[cur], dp1[cur] + M, dp1[nxt]);

    for (int j = 0; j < M && j + wi < M; j++)
      if (dp0[cur][j] > -INF) {
	int dj = dp0[cur][j] + vi, j1 = j + wi;
	if (dp0[nxt][j1] < dj)
	  dp0[nxt][j1] = dj, dp1[nxt][j1] = dp1[cur][j];
	else if (dp0[nxt][j1] == dj)
	  addmod(dp1[nxt][j1], dp1[cur][j]);
      }

    swap(cur, nxt);
  }

  int xd0 = -INF, xd1 = 0;
  for (int j = w - MIN_W; j >= 0; j--) {
    if (xd0 < dp0[cur][j])
      xd0 = dp0[cur][j], xd1 = dp1[cur][j];
    else if (xd0 == dp0[cur][j])
      addmod(xd1, dp1[cur][j]);
  }

  printf("%d %d\n", xd0, xd1);
  
  return 0;
}