#include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define REP(i,n) for(int i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)
//#define INF 1<<29
#define LINF LLONG_MAX/3
#define MP make_pair
#define PB push_back
#define EB emplace_back
#define ALL(v) (v).begin(),(v).end()
#define all(v) ALL(v)
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
#define CININIT cin.tie(0),ios::sync_with_stdio(false)
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }

constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

ll N,K;

int main(){
    cin>>N>>K;
    vector<ll> T(N+2),D(N+2);
    rep(i,N) cin>>T[i+1]>>D[i+1];
    T[0] = -K-10;
    D[0] = 0;
    T[N] = T[N-1]+K+10;
    D[N] = 0;

    ll sum = 0;
    rep(i,N) sum += D[i];

    vector<ll> dp(N+10,0);
    dp[0]=0;

    set<ll> ans;
    for(int i=0;i<N+2;i++){
        int idx = lower_bound(all(T),T[i]+K)-T.begin();
        if(dp[idx]<=dp[i]+D[i]){
            ans.insert(i);
        }
        dp[idx] = max(dp[idx],dp[i]+D[i]);
    }

    //for(int i=0;i<N+2;i++){
    //    cout << "i , dp[i] = " << i << " " << dp[i] << endl;
    //}

    int ret=0;
    for(int i=1;i<N;i++){
        if(!ans.count(i)) ret=max<ll>(ret,D[i]);
    }
    cout << ret << endl;

    ll mx = dp[N];
    cout << sum-mx << endl;
}