#include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef unsigned long long int ulint; typedef long long int llint; typedef long double lldo; #define mp make_pair #define mt make_tuple #define pub push_back #define puf push_front #define pob pop_back #define pof pop_front #define fir first #define sec second #define res resize #define ins insert #define era erase #define RE return 0 //ios::sync_with_stdio(false); //std::cin.tie(0); //<< setprecision(20) const int mod=(int)1e9+7; const llint big=(llint)1e17+100; const long double pai=3.141592653589793238462643383279502884197; const long double ena=2.71828182845904523536; const long double eps=1e-7; template void mineq(T& a,U b){if(a>b){a=b;}} template void maxeq(T& a,U b){if(a void soun(T& ar) {sort(ar.begin(),ar.end());ar.erase(unique(ar.begin(),ar.end()),ar.end());} llint gcd(llint a,llint b){if(a%b==0){return b;}else{return gcd(b,a%b);}} llint lcm(llint a,llint b){return a/gcd(a,b) *b;} template auto LB(T& ve,U in){return lower_bound(ve.begin(),ve.end(),in);} template auto UB(T& ve,U in){return upper_bound(ve.begin(),ve.end(),in);} template auto LBI(T& ve,U in){return LB(ve,in)-ve.begin();} template auto UBI(T& ve,U in){return UB(ve,in)-ve.begin();} template void SO(T& ve){sort(ve.begin(),ve.end());} template void REV(T& ve){reverse(ve.begin(),ve.end());} bool solve(void){ int a,b,c,x,y,z;cin>>a>>b>>c>>x>>y>>z; if(a>n;while(n--){cout<<(solve()?"YES":"NO")<