using namespace std;
#include<bits/stdc++.h>
void testcases()
{
int n,time,pow;
cin>>n>>time>>pow;
int f=0;
while(n>0)
{
	int temp1,temp2;
cin>>temp1>>temp2;
if(temp1<time &&  temp2>pow)
f=1;
n-=1;
}
cout<<((f==1)?"Yes":"No")<<endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(NULL);
	//freopen("in.txt","r",stdin);
	//freopen("out.txt","w",stdout);
/*int t;
cin>>t;
while(t--)*/
testcases();
}
#include <bits/stdc++.h>
#include <math.h>
using namespace std;
using ll = long long;
using vll = vector<ll>;
using vvll = vector<vll>;
using vpl = vector<pair<ll, ll>>;
using pll = pair<ll, ll>;
#define rep(i, k, n) for(ll i = k; i < n; i++)
#define pb push_back
#define mp make_pair

int main(){
    ll t; cin >> t;
    vll ans(0);
    rep(i, 0, t){
        ll l, r;
        cin >> l >> r;

        if(r-2*l+2<=0 || r-2*l+1<=0){
            ans.pb(0);
            continue;
        }
        ans.pb((r-2*l+2)*(r-2*l+1)/2);
    }

    rep(i, 0, ans.size()){
        cout << ans[i] << endl;
    }
}