#include<iostream>
#include<unordered_set>

using namespace std;

int main(){
    int N;
    cin >> N;
    string str;
    string ss[N];

    unordered_set<string> s;
    for(int i=0; i<N; i++){
        cin >> str;
        s.insert(str);
        ss[i] = str;
    }
    for(int i=0; i<N; i++){
        string ch = "!" + ss[i];
        if(s.find(ch)!=s.end()){
            cout << ss[i] << endl;
            return 0;
        }     
    }
    cout << "satisfiable" << endl;
}
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i,n) for(int i=0;i<n;i++)
#define rep3(i,in,fn) for(int i=in;i<=fn;i++)

int main(){
  int N,S,D;
  cin >> N >> S >> D;
  int X,Y;
  rep(i,N){
    cin >> X >> Y;
    if(X<S && Y>D){
      cout << "Yes" << endl;
      return 0;
    }
  }
  cout << "No" << endl;
}
