Kefa and Company

Description

Kefa wants to celebrate his first big salary by going to restaurant. However, he needs company.

Kefa has n friends, each friend will agree to go to the restaurant if Kefa asks. Each friend is characterized by the amount of money he has and the friendship factor in respect to Kefa. The parrot doesn't want any friend to feel poor compared to somebody else in the company (Kefa doesn't count). A friend feels poor if in the company there is someone who has at least d units of money more than he does. Also, Kefa wants the total friendship factor of the members of the company to be maximum. Help him invite an optimal company!

Input

The first line of the input contains two space-separated integers, n and d (1 ≤ n ≤ 10⁵, ) — the number of Kefa's friends and the minimum difference between the amount of money in order to feel poor, respectively.

Next n lines contain the descriptions of Kefa's friends, the (i + 1)-th line contains the description of the i-th friend of type m_i, s_i (0 ≤ m_i, s_i ≤ 10⁹) — the amount of money and the friendship factor, respectively.

Output

Print the maximum total friendship factir that can be reached.

Sample Input

Input

4 5
75 5
0 100
150 20
75 1

Output

100  

Input

5 100
0 7
11 32
99 10
46 8
87 54

Output

111

Hint

In the first sample test the most profitable strategy is to form a company from only the second friend. At all other variants the total degree of friendship will be worse.

In the second sample test we can take all the friends.

第一组数据max（100,5,6,20）

第二组数据7+32+10+8+54

#include<cstdio>
#include<algorithm>
using namespace std;
struct node
{
	long long a,b;
}s[100001];
bool cmp(node a,node b)
{
	return a.a <b.a ;
}
int main()
{
      long long  n,m;
	scanf("%lld%lld",&n,&m);
	for(int i=0;i<n;i++)
	{
		scanf("%lld%lld",&s[i].a ,&s[i].b );
      }
	sort(s,s+n,cmp);
	long long  max=0,sum=0,q=0;
	for(int i=0;i<n;i++ )
	{
		sum+=s[i].b ;
		while(s[i].a >=s[q].a +m)
		{
			sum-=s[q].b ;
			q++;
		}
		if(max<sum)
		{
			max=sum;
		}
	}
	printf("%lld",max);
	return 0;
}