#include //#include using namespace std; //using namespace atcoder; using ll = long long; using ld = long double; #define all(s) (s).begin(),(s).end() #define vcin(n) for(ll i=0;i>n[i] #define rever(vec) reverse(vec.begin(), vec.end()) #define sor(vec) sort(vec.begin(), vec.end()) #define fi first #define se second #define SIZE(n) int(n.size()) #define P pair //const ll mod = 998244353; const ll mod = 1000000007; const ll inf = 2000000000000000000ll; static const long double pi = 3.141592653589793; template void chmax(T& t,const U& u){if(t void chmin(T& t,const U& u){if(t>u) t=u;} ll modPow(ll a, ll n, ll modulo) { ll ret = 1; ll p = a % modulo; while (n) { if (n & 1) ret = ret * p % modulo; p = p * p % modulo; n >>= 1; } return ret; } bool check(ll a,ll b,ll c){ if((a-c)*(b-c)>0){ return true; } return false; } int main() { /* mod は 1e9+7 */ ios::sync_with_stdio(false); std::cin.tie(nullptr); cout<< fixed << setprecision(10); vector a(3),b(3); vcin(a); vcin(b); for(int i=0;i<3;i++){ for(int j=0;j<3;j++){ vector c=a,d=b; swap(c[i],d[j]); if(check(c[0],c[1],c[2])&&check(d[0],d[1],d[2])){ cout<<"Yes"<