Hey community. Can anyone share their emacs keybindings for faster navigation around braces or C++ in general? Thanks in Advance.

Hello community.I participated in recent Goodbye2020 round.Although I performed badly in it still i got a huge rating drop.I later on came to know about mass cheating by over 3000 people.Is it high time to stop fantasizing about rating on cf? Is cp not for enjoyement and self improvement anymore?

Hi community. I was giving test for some hiring test. The problem says given an array of size N and numbers from 1...M find number of ways to create the array with the followings restrictions. 1) a[i]≠a[i+1] 2) a[1]=a[N] (1 based index) Constraints 3<=N,M<=10^18 I was came up with formula M*(M-1)^(N-3)*(M-2) n>3 and M*(M-1) n==3 But it gave WA. Any suggestions. Thankyou in advance.

Hi codeforces..As atoj is down already. Is there any place or websites to find all div2C and div2D? Any help would be highly appreciated. Note I am not talking about codeforces feature of sorting by rating.

HI community I needed help in this coding problem.Any help would be appreciated, Thanks.

You are a coach of World Duo Coding championship. You want to choose the strongest team of two players from N players.Each player has some scores based on two parameters, Coordination and Problem Solving skills. The overall skill of a team is evaluated as the sum of Problem Solving Skills of both players and the absolute difference between Coordination of both players.

For example c[1] and ps [1] are Coordination and Problem Solving skills of player 1

c[2] and ps[2] are Coordination and Problem Solving Skills of Player 2

Then overall skill of the team of these two players is ps[1] + ps[2] + abs(c[1] – c[2]) The host of the contest has decided parameter K such that no team must have the absolute difference between the Coordination of both players more than K, that is, abs(c[1] — c[2]) <=K It is guaranteed that there exists at least one pair of players that satisfy the constraint abs(c[1] — c[2])<=k.

Your task is to determine the maximum possible overall skill of a team that you can send in this tournament

Input format an integer I denoting the number of test cases.​

N,K denoting no of players and the parameter.

Next N lines contains c[i] and ps[i] denoting the coordination and problem solving skill of ith player.

Constraints N 10^5

k 10^8

c[i] ,ps[i] 10^8

SAMPLE INPUT

4 1

5 3

6 0

9 10

10 -10

OUTPUT

4