#include <iostream>
#include <string>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <complex>
#include <utility>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <bitset>
#include <ctime>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <cassert>
#include <cstddef>
#include <iomanip>
#include <numeric>
#include <tuple>
#include <sstream>
#include <fstream>
#include <chrono>
#include <random>

using namespace std;
#define REP(i, n) for (int (i) = 0; (i) < (n); (i)++)
#define FOR(i, a, b) for (int (i) = (a); (i) < (b); (i)++)
#define RREP(i, a) for(int (i) = (a) - 1; (i) >= 0; (i)--)
#define FORR(i, a, b) for(int (i) = (a) - 1; (i) >= (b); (i)--)
#define DEBUG(C) cerr << #C << " = " << C << endl;
using LL = long long;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<LL>;
using VVL = vector<VL>;
using VD = vector<double>;
using VVD = vector<VD>;
using PII = pair<int, int>;
using PDD = pair<double, double>;
using PLL = pair<LL, LL>;
using VPII = vector<PII>;
template<typename T> using VT = vector<T>;
#define ALL(a) begin((a)), end((a))
#define RALL(a) rbegin((a)), rend((a))
#define SORT(a) sort(ALL((a)))
#define RSORT(a) sort(RALL((a)))
#define REVERSE(a) reverse(ALL((a)))
#define MP make_pair
#define FORE(a, b) for (auto &&a : (b))
#define FIND(s, e) ((s).find(e) != (s).end())
#define EB emplace_back

const int INF = 1e9;
const int MOD = INF + 7;
const LL LLINF = 1e18;

int N, K;
const int MAX_N = 2 * 1e5 + 5;
VT<PLL> td;
VL T, D;
LL sum = 0;

bool check(int highD) {
    int lastHElpTime = -K;
    REP(i, N) {
        if (D[i] > highD) {
            int next = lastHElpTime + K;
            if (next > T[i]) return false;
            lastHElpTime = T[i];
        }
    }
    return true;
}

int main(void) {
    cin >> N >> K;
    T.resize(N);
    D = T;
    REP(i, N) {
        int t, d;
        cin >> t >> d;
        T[i] = t;
        D[i] = d;
        sum += d;
    }
    int ok = INF + 1, ng = 0;
    while (ok > ng) {
        int mid = (ok + ng) / 2;
        if (check(mid)) ok = mid;
        else ng = mid + 1;
    }
    cout << ok << endl;
    set<int> canYukiHelpIdx;
    REP(i, N) {
        if (ok < D[i]) canYukiHelpIdx.insert(i);
    }
    set<int> buf;
    auto itr = canYukiHelpIdx.begin();
    int yukiLastHelpTime = -K;
    REP(i, N) {
        if (*itr == i) {
            yukiLastHelpTime = T[*itr++];
        } else {
            int nextYukiHelpTime = yukiLastHelpTime + K;
            if (nextYukiHelpTime <= T[i] && (T[i] + K <= T[*itr] || itr == canYukiHelpIdx.end())) {
                buf.insert(i); yukiLastHelpTime = T[i];
            }
        }
    }
    FORE(e, buf) canYukiHelpIdx.insert(e);
    int minus = 0;
    FORE(e, canYukiHelpIdx) minus += D[e];
    cout << sum - minus << endl;
    return 0;
}