/* -*- coding: utf-8 -*-
 *
 * 448.cc: No.448 ゆきこーだーの雨と雪 (3) - yukicoder
 */

#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<stack>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<functional>
 
using namespace std;

/* constant */

const int MAX_N = 200000;
const int MAX_E2 = 1 << 19; // = 524288
const int INF = 2100000000;

/* typedef */

typedef long long ll;

template <typename T, const int MAX_E2>
struct SegTreeMax {
  int n, e2;
  T nodes[MAX_E2];
  SegTreeMax() {}

  void init(int _n) {
    n = _n;
    for (e2 = 1; e2 < n; e2 <<= 1);
    memset(nodes, 0, sizeof(nodes));
  }

  T get(int i) { return nodes[e2 - 1 + i]; }

  void set_all() {
    for (int i = e2 - 2; i >= 0; i--)
      nodes[i] = max(nodes[i * 2 + 1], nodes[i * 2 + 2]);
  }

  T max_range(int r0, int r1, int k, int i0, int i1) {
    if (r1 <= i0 || i1 <= r0) return 0;
    if (r0 <= i0 && i1 <= r1) return nodes[k];

    int im = (i0 + i1) / 2;
    T v0 = max_range(r0, r1, k * 2 + 1, i0, im);
    T v1 = max_range(r0, r1, k * 2 + 2, im, i1);

    return max(v0, v1);
  }

  T max_range(int r0, int r1) {
    return max_range(r0, r1, 0, 0, e2);
  }
};

/* global variables */

int ts[MAX_N + 1], ds[MAX_N + 1];
ll dsums[MAX_N + 1];
SegTreeMax<int,MAX_E2> stm;
int dp0[MAX_N + 1];
ll dp1[MAX_N + 1];

/* subroutines */

/* main */

int main() {
  int n, k;
  scanf("%d%d", &n, &k);

  stm.init(n);
  dsums[0] = 0;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &ts[i], &ds[i]);
    stm.nodes[stm.e2 - 1 + i] = ds[i];
    dsums[i + 1] = dsums[i] + ds[i];
  }
  stm.set_all();
  ts[n] = INF, ds[n] = 0;

  for (int i = 0; i <= n; i++) dp0[i] = INF, dp1[i] = 0;
  dp0[0] = 0;

  for (int i = 0; i < n; i++) {
    int d0 = max(dp0[i], ds[i]);
    ll d1 = dp1[i] + ds[i];
    if (dp0[i + 1] > d0 || (dp0[i + 1] == d0 && dp1[i + 1] > d1))
      dp0[i + 1] = d0, dp1[i + 1] = d1;

    int j = lower_bound(ts + i, ts + n + 1, ts[i] + k) - ts;
    d0 = max(dp0[i], stm.max_range(i + 1, j));
    d1 = dp1[i] + dsums[j] - dsums[i + 1];
    if (dp0[j] > d0 || (dp0[j] == d0 && dp1[j] > d1))
      dp0[j] = d0, dp1[j] = d1;
  }

  printf("%d\n%lld\n", dp0[n], dp1[n]);
  return 0;
}