#include <bits/stdc++.h>
using namespace std;

#ifdef local
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(args...) qqbx(#args, args)
#define orange(args...) danb(#args, args)
using std::cerr;
template <typename ...T> void qqbx(const char *s, T ...args) {
  int cnt = sizeof...(T);
  ((cerr << "\e[1;32m(" << s << ") = ("), ..., (cerr << args << (--cnt ? ", " : ")\e[0m\n")));
}
template <typename I> void danb(const char *s, I L, I R) {
  cerr << "\e[1;32m[ " << s << " ] = [ ";
  for (int f = 0; L != R; ++L) cerr << (f++ ? ", " : "") << *L;
  cerr << " ]\e[0m\n";
}
#else
#define safe ((void)0)
#define debug(...) ((void)0)
#define orange(...) ((void)0)
#endif // local
#define all(v) begin(v),end(v)

const int mod = 1000000007;

int modadd(int a, int b) {
  return a + b >= mod ? a + b - mod : a + b;
}

void chmax(pair<int,int> &a, pair<int,int> b) {
  if (a.first < b.first)
    a = b;
  else if (a.first == b.first)
    a.second = modadd(a.second, b.second);
}
const int inf = 1e9;

signed main() {
  ios_base::sync_with_stdio(0), cin.tie(0);
  int n, d;
  cin >> n >> d;

  vector<int> big, small;
  for (int i = 0; i < n; i++) {
    int w;
    cin >> w;
    if (w + w >= d)
      big.push_back(min(w, d));
    else
      small.push_back(w);
  }

  const int m = big.size();
  ranges::sort(big, greater<>());

  vector<int> cnt(m + 1);
  for (int s: small) {
    int j = upper_bound(big.begin(), big.end(), d - s, greater<>()) - big.begin();
    cnt[j] += 1;
  }


  auto dp = vector(m + 1, vector(m + 1, pair{-inf, 0}));
  dp[0][0] = {0, 1};

  for (int a = 0; a <= m; a++) {
    for (int b = 0; a + b <= m; b++) {
      if (dp[a][b].second == 0) continue;

      dp[a][b].first += max(a, b) * cnt[a + b];
      if (a == b) {
        for (int j = 0; j < cnt[a + b]; j++)
          dp[a][b].second = modadd(dp[a][b].second, dp[a][b].second);
      }

      if (a + 1 <= m)
        chmax(dp[a + 1][b], dp[a][b]);
      if (b + 1 <= m)
        chmax(dp[a][b + 1], dp[a][b]);
    }
  }

  pair<int,int> ans = {-inf, 0};
  for (int a = 0; a <= m; a++) {
    auto p = dp[a][m - a];
    debug(p.first, a, m - a);
    p.first += a * (m - a);
    chmax(ans, p);
  }

  cout << ans.first << ' ' << ans.second << '\n';
}