using System;
using System.Collections;
using System.Collections.Generic;
using System.Linq;
using System.Text;

class TEST{
	static void Main(){
		Sol mySol =new Sol();
		mySol.Solve();
	}
}

class Sol{
	public void Solve(){
		
		Pair[] P = new Pair[N];
		Dictionary<long,int> dic = new Dictionary<long,int>();
		
		for(int i=0;i<N;i++){
			P[i] = new Pair(T[i],D[i],i);
			if(dic.ContainsKey(D[i]) == false) dic.Add(D[i],0);
			dic[D[i]]++;
		}
		
		Array.Sort(P,(p,q) => -p.D.CompareTo(q.D));
		bool[] forbid = new bool[N];
		for(int i=0;i<N;i++){
			var idx = P[i].Idx;
			var d = P[i].D;
			var t = P[i].T;
			if(forbid[idx])break;
			dic[d]--;
			int j = idx;
			while(j>=0 && T[idx] - T[j] < K){
				forbid[j] = true;
				j--;
			}
			j = idx;
			while(j<N && T[j] - T[idx] < K){
				forbid[j] = true;
				j++;
			}
		}
		
		long yukiMin = (long)2e9;;
		for(int i=0;i<N;i++){
			if(dic[P[i].D] != 0)break;
			yukiMin = P[i].D;
		}
		
		long ameMax = 0;
		for(int i=0;i<N;i++){
			if(D[i] >= yukiMin)continue;
			ameMax = Math.Max(ameMax,D[i]);
		}
		
		long yukiDo = 0;
		bool[] used = new bool[N];
		forbid = new bool[N];
		for(int i=0;i<N;i++){
			if(D[i] >= yukiMin){
				used[i] = true;
				int j=i-1;
				while(j>=0 && T[i] - T[j] < K){
					forbid[j] = true;
					j--;
				}
				yukiDo += D[i];
			}
		}
		
		//Console.WriteLine("forbid:{0}",String.Join(" ",forbid));
		//Console.WriteLine("used  :{0}",String.Join(" ",used));
		
		int[] nxt = new int[N];
		int nn=0;
		for(int i=0;i<N;i++){
			while(nn<N && T[nn] - T[i] < K)nn++;
			nxt[i] = nn;
		}
		
		long[] dp = new long[N+1];
		for(int i=0;i<N;i++){
			if(forbid[i]){
				dp[i+1] = Math.Max(dp[i],dp[i+1]);
			}else if(used[i]){
				dp[nxt[i]] = dp[i];
				i = nxt[i] - 1;
			}else{
				dp[i+1] = Math.Max(dp[i],dp[i+1]);
				dp[nxt[i]] = Math.Max(dp[i],dp[nxt[i]]+D[i]);
			}
		}
		
		//Console.WriteLine("Dsum = {0}",D.Sum());
		//Console.WriteLine("yukiDo = {0}",yukiDo);
		//Console.WriteLine("dp = {0}",String.Join(" ",dp));
		
		long ameDo = D.Sum() - yukiDo - dp[N];
		Console.WriteLine("{0} {1}",ameMax,ameDo);
		
	}
	
	class Pair{
		public long T,D;
		public int Idx;
		public Pair(long t,long d,int i){
			T = t; D= d; Idx = i;
		}
	}
	
	int N,K;
	long[] T;
	long[] D;
	public Sol(){
		var d = ria();
		N = d[0]; K = d[1];
		T = new long[N];
		D = new long[N];
		for(int i=0;i<N;i++){
			var dd = rla();
			T[i] = dd[0];
			D[i] = dd[1];
		}
	}
	

	static String rs(){return Console.ReadLine();}
	static int ri(){return int.Parse(Console.ReadLine());}
	static long rl(){return long.Parse(Console.ReadLine());}
	static double rd(){return double.Parse(Console.ReadLine());}
	static String[] rsa(char sep=' '){return Console.ReadLine().Split(sep);}
	static int[] ria(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>int.Parse(e));}
	static long[] rla(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>long.Parse(e));}
	static double[] rda(char sep=' '){return Array.ConvertAll(Console.ReadLine().Split(sep),e=>double.Parse(e));}
}

class BIT{
	int MM;
	int n;
	long[] bit;
	public BIT(int n_){
		n=n_;
		MM=1<<18;
		while(MM<n*2)MM<<=1;
		bit=new long[MM+1];
	}
	//1-origin!!
	public void Add(int i,int x){
		while(i<=n){
			bit[i]+=x;
			i+=(i&-i);
		}
	}
	
	// i=>sum(a_1,...,a_i)
	// i=0 -> return 0;
	public long Sum(int i){
		long s=0;
		while(i>0){
			s+=bit[i];
			i-= (i&-i);
		}
		return s;
	}
}