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

#define _p(...) (void)printf(__VA_ARGS__)
#define forr(x,arr) for(auto&& x:arr)
#define _overload3(_1,_2,_3,name,...) name
#define _rep2(i,n) _rep3(i,0,n)
#define _rep3(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload3(__VA_ARGS__,_rep3,_rep2,)(__VA_ARGS__)
#define _rrep2(i,n) _rrep3(i,0,n)
#define _rrep3(i,a,b) for(int i=int(b)-1;i>=int(a);i--)
#define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__)
#define all(x) (x).begin(), (x).end()
#define bit(n) (1LL<<(n))
#define sz(x) ((int)(x).size())
#define fst first
#define snd second
using ll=long long;using pii=pair<int,int>;using vb=vector<bool>;
using vi=vector<int>;using vvi=vector<vi>;using vvvi=vector<vvi>;
using vl=vector<ll>;using vvl=vector<vl>;using vvvl=vector<vvl>;
using vd=vector<double>;using vvd=vector<vd>;using vvvd=vector<vvd>;
using vpii=vector<pii>;using vvpii=vector<vpii>;using vvvpii=vector<vvpii>;
template <typename T> T read() {T t; cin >> t; return t;}

template<class V> struct SegTree0 {
  const int n;
  vector<V> val;

  SegTree0(int _n): n(p2(_n)), val(n * 2, def) {}
  void reinit() {
    val.fill(def);
  }
  V getval(int a, int b) {
    return getval(a, b, 0, 0, n);
  }
  void update(int i, V v) {
    i += n - 1;
    val[i] = v;
    while (i > 0) {
      i = (i - 1) / 2;
      val[i] = comp(val[i * 2 + 1], val[i * 2 + 2]);
    }
  }
  private:
  V getval(int a, int b, int k, int l, int r) {
    if (r <= a || b <= l) return def;
    if (a <= l && r <= b) return val[k];
    return comp(getval(a, b, k * 2 + 1, l, (l + r) / 2), getval(a, b, k * 2 + 2, (l + r) / 2, r));
  }
  static int p2(int n, int m=1) { return m >= n ? m : p2(n, m * 2); }
  V comp(const V& l, const V& r) { return max(l, r);};
  const V def = 0;
};

template<class T> bool amin(T &a, const T &b) { if (b < a) { a = b; return 1; } return 0; }

void Main() {
  int n = read<ll>();
  ll k = read<ll>();

  vl T(n), D(n);
  SegTree0<ll> seg(n);

  rep(i, n) {
    T[i] = read<ll>();
    D[i] = read<ll>();
    seg.update(i, D[i]);
  }

  vector<ll> R(sz(D)+1);
  rep(ii, sz(D)) R[ii+1] = R[ii] + D[ii];

  const ll inf = 1e18+7;

  ll ma;
  {
    vl dp(n+1, inf);
    dp[0] = 0;

    rep(i, n) {
      ll t = T[i];
      ll d = D[i];

      // yaru
      amin(dp[i + 1], max(dp[i], d));

      // yaraseru
      int ni = distance(T.begin(), lower_bound(all(T), t + k));
      amin(dp[ni], max(dp[i], seg.getval(i + 1, ni)));
    }
    ma = dp[n];
  }

  ll su;
  {
    vl dp(n+1, inf);
    dp[0] = 0;

    rep(i, n) if (dp[i] < inf) {
      ll t = T[i];
      ll d = D[i];

      if (d <= ma) {
        // yaru
        amin(dp[i + 1], dp[i] + d);
      }

      // yaraseru
      int ni = distance(T.begin(), lower_bound(all(T), t + k));
      ll must = seg.getval(i + 1, ni);
      if (must <= ma) {
        amin(dp[ni], dp[i] + R[ni - 1 + 1] - R[i + 1]);
      }
    }
    su = dp[n];
  }


  cout << ma << endl << su << endl;
}
int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }