#include #define rep(i, n) for (int i = 0; i < (int)(n); i++) #define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--) #define all(x) (x).begin(), (x).end() #define sz(x) int(x.size()) #define yn(joken) cout<<((joken) ? "Yes" : "No")<; using vl = vector; using vs = vector; using vc = vector; using vd = vector; using vvi = vector>; using vvl = vector>; const int INF = 1e9; const ll LINF = 1e18; template bool chmax(T& a, const T& b) { if (a < b) { a = b; return 1; } return 0; } template bool chmin(T& a, const T& b) { if (b < a) { a = b; return 1; } return 0; } template vector make_vec(size_t a) { return vector(a); } template auto make_vec(size_t a, Ts... ts) { return vector(ts...))>(a, make_vec(ts...)); } template istream& operator>>(istream& is, vector& v) { for (int i = 0; i < int(v.size()); i++) { is >> v[i]; } return is; } template ostream& operator<<(ostream& os, const vector& v) { for (int i = 0; i < int(v.size()); i++) { os << v[i]; if (i < int(v.size()) - 1) os << ' '; } return os; } int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); vi A(3),B(3); cin>>A>>B; bool flg=false; rep(i,3){ rep(j,3){ bool f1=false,f2=false; swap(A[i],B[j]); if(A[0]!=A[2] && ((A[0]>A[1] && A[1]A[2]))) f1=true; if(B[0]!=B[2] && ((B[0]>B[1] && B[1]B[2]))) f2=true; flg|=f1&&f2; swap(A[i],B[j]); } } yn(flg); }