#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;
VL tim, timeSum;
VT<PLL> td;

bool check(const int highD) {
    int lastHelpTime = 0;
    FORE(e, td) {
        if (e.second >= highD) {
            int nextCanHelpTime = lastHelpTime + K;
            if (nextCanHelpTime > e.first) {
                return false;
            }
            lastHelpTime = e.first;
        }
    }
    return true;
}

int main(void) {
    cin >> N >> K;
    td.resize(N);
    timeSum.resize(N);
    int maxD = 0;
    LL sum = 0;
    set<int> timeset;
    REP(i, N) {
        int D, tim;
        scanf("%d%d", &tim, &D);
        td[i] = MP(tim, D);
        timeset.insert(tim);
        maxD = max(maxD, D);
        sum += D;
    }
    //cout << minD << " " << maxD << endl;
    int minD = 0;
    while (maxD - minD > 1) {
        int mid = (maxD + minD) / 2;
        if (check(mid)) maxD = mid;
        else minD = mid;
    }
    maxD = minD;
    int high = N, low = 0;
    while (high - low > 1) {
        int mid = (high + low) / 2;
        if (td[mid].second <= maxD) low = mid;
        else high = mid;
    }
    maxD = td[low].second;
    set<int> helpYukiIdx;
    REP(i, N) {
        if (td[i].second > maxD) helpYukiIdx.insert(i);
    }
    auto itr = helpYukiIdx.begin();
    int lastTime = -K;
    set<int> buf;
    REP(i, N) {
        if (i == *itr) {
            *itr++;
            lastTime = td[i].first;
            continue;
        }
        if (lastTime + K <= td[i].first) {
            if (itr != helpYukiIdx.end () && td[i].first <= td[*itr].first) {
                buf.insert(i); lastTime = td[i].first;
            } else if (itr == helpYukiIdx.end()) {
                buf.insert(i); lastTime = td[i].first;
            }
        }
    }
    FORE(e, buf) helpYukiIdx.insert(e);
    //FORE(e, helpYukiIdx) DEBUG(e)
    LL ans = 0;
    REP(i, N) {
        if (!FIND(helpYukiIdx, i)) ans += td[i].second;
    }
    cout << maxD << endl << ans << endl;
    return 0;
}