#include <bits/stdc++.h>
using namespace std;
#include <unistd.h>

// https://judge.yosupo.jp/submission/217135
using idt=std::size_t;
template<class _Tp>
struct _Sprod{
    _Tp*f;
    idt n;
    _Sprod():f(nullptr),n(0){}
    void build(idt _n,auto&&fn){
        delete []f;
        f=new _Tp[(_n<2?1:(std::__lg(_n-1)+1))*_n];
        n=_n;
        for(idt i=0;i<n;++i){
            f[i]=fn(i);
        }
        for(idt j=2,w=1;j<n;j<<=1,++w){
            auto t=f+w*n;
            for(idt i=0;i+j<n;i+=2*j){
                t[i+j-1]=f[i+j-1],t[i+j]=f[i+j];
                for(idt k=i+j-1;k>i;--k){
                    t[k-1]=f[k-1]*t[k];
                }
                idt ed=std::min(n,i+j+j)-1;
                for(idt k=i+j;k<ed;++k){
                    t[k+1]=t[k]*f[k+1];
                }
            }
        }
    }
    ~_Sprod(){
        delete []f;
    }
    _Tp get(idt l,idt r)const{
        if(l==r){
            return f[l];
        }
        auto t=f+(63^__builtin_clzll(l^r))*n;
        return t[l]*t[r];
    }
};
template<class _Tp,idt _Bk=16>
struct RangeProd{
    _Tp*arr,*pre,*suf;
    idt n;
    _Sprod<_Tp> spd;
    RangeProd(idt _n,auto&&fn):arr(new _Tp[_n]),pre(new _Tp[_n]),suf(new _Tp[_n]),n(_n){
        for(idt i=0;i<n;++i){
            arr[i]=fn(i);
        }
        for(idt i=0;i<n;i+=_Bk){
            pre[i]=arr[i];
            for(idt j=i+1,ed=std::min(n,i+_Bk);j<ed;++j){
                pre[j]=pre[j-1]*arr[j];
            }
        }
        for(idt i=0;i<n;i+=_Bk){
            idt ed=std::min(n,i+_Bk);
            suf[ed-1]=arr[ed-1];
            for(idt j=ed-1;j!=i;--j){
                suf[j-1]=arr[j-1]*suf[j];
            }
        }
        if(n>_Bk){
            spd.build(n/_Bk,[&](idt i){
                return suf[i*_Bk];
            });
        }
    }
    ~RangeProd(){
        delete []arr;
        delete []pre;
        delete []suf;
    }
    _Tp get(idt l,idt r)const{
        idt bl=l/_Bk,br=r/_Bk;
        if(bl==br){
			_Tp res=arr[l];
			for(idt i=l+1;i<=r;++i){
				res=res*arr[i];
			}
            return res;
		}
        if(bl+1==br){
            return suf[l]*pre[r];
        }
        return suf[l]*spd.get(bl+1,br-1)*pre[r];
    }
};

struct Data {
    long long l1, l2, l3, r1, r2, r3;
    Data operator*(Data b) const {
        return { max(l1, b.l1), max(l2, b.l2), max(l3, b.l3), min(r1, b.r1), min(r2, b.r2), min(r3, b.r3) };
    }
};
char outbuf[800064];
int main() {
    cin.tie(0)->sync_with_stdio(0);
    int N;
    cin >> N;
    RangeProd<Data> st(N, [](idt i) -> Data {
        long long A, B, D;
        cin >> A >> B >> D;
        return { B - D, (A - D) + (B - D), A - B, B, A + B, (A + D) - (B - D) };
    });
    int Q;
    cin >> Q;
    char* out = outbuf;
    while(Q--) {
        int S, L, R;
        cin >> S >> L >> R;
        auto [l1, l2, l3, r1, r2, r3] = st.arr[S - 1];
        auto [sl1, sl2, sl3, sr1, sr2, sr3] = st.get(L - 1, R - 1);
        const bool f = l1 < sr1 && sl1 < r1 && l2 < sr2 && sl2 < r2 && l3 < sr3 && sl3 < r3;
        memcpy(out, f ? "Yes\n" : "No\n\0", 4);
        out += 3 + f;
    }
    write(1, outbuf, out - outbuf);
}