Lunch Rush

Description

Having written another programming contest, three Rabbits decided to grab some lunch. The coach gave the team exactly k time units for the lunch break.

The Rabbits have a list of n restaurants to lunch in: the i-th restaurant is characterized by two integers f_i and t_i. Value t_i shows the time the Rabbits need to lunch in the i-th restaurant. If time t_i exceeds the time k that the coach has given for the lunch break, then the Rabbits' joy from lunching in this restaurant will equal f_i - (t_i - k). Otherwise, the Rabbits get exactly f_i units of joy.

Your task is to find the value of the maximum joy the Rabbits can get from the lunch, depending on the restaurant. The Rabbits must choose exactly one restaurant to lunch in. Note that the joy value isn't necessarily a positive value.

Input

The first line contains two space-separated integers — n (1 ≤ n ≤ 10⁴) and k (1 ≤ k ≤ 10⁹) — the number of restaurants in the Rabbits' list and the time the coach has given them to lunch, correspondingly. Each of the next n lines contains two space-separated integers — f_i (1 ≤ f_i ≤ 10⁹) and t_i (1 ≤ t_i ≤ 10⁹) — the characteristics of the i-th restaurant.

Output

In a single line print a single integer — the maximum joy value that the Rabbits will get from the lunch.

Sample Input

Input

2 5
3 3
4 5

Output

4

Input

4 6
5 8
3 6
2 3
2 2

Output

3

Input

1 5
1 7

Output

-1

#include<iostream>
#include<algorithm>
using namespace std;

int main(){
    int n;
    long long int k,f,t,temp,mymax;
        while(cin>>n>>k){
            mymax=-111111111111111;
            while(n--){
                cin>>f>>t;
                if(t<=k){
                    temp=f;
                }
                else{
                    temp=f-(t-k);
                }
                mymax=max(temp,mymax);
            }
            cout<<mymax<<endl;
        }
    return 0;
}