#include<cstdio>

#include<cstring>

#include<cmath>

#include<algorithm>

using namespace std;

const int maxn=+;

struct Exam

{

    int r,e,l;

    int Start,End;

}E[maxn];

int T,n;

bool cmp(const Exam&a,const Exam&b)

{

    return a.e<b.e;

}

int main()

{

    scanf("%d",&T);

    for(int t=;t<=T;t++)

    {

        scanf("%d",&n);

        for(int i=;i<n;i++)

        {

            scanf("%d%d%d",&E[i].r,&E[i].e,&E[i].l);

            E[i].Start=E[i].e; //考试开始时间

            E[i].End=E[i].e+E[i].l; //考试结束时间

        }

        sort(E,E+n,cmp);

        int preEnd=;

        int k=;

        int ans=;

        for(int i=;i<n;i++)

        {

            int Len=E[i].Start-preEnd;

            while(Len)

            {

                int Min=min(E[k].r,Len);

                E[k].r=E[k].r-Min;

                Len=Len-Min;

                if(E[k].r==) k++;

            }

            if(E[i].r!=) {ans=; break;}

            preEnd=E[i].End;

        }

        printf("Case #%d: ",t);

        if(ans) printf("NO\n");

        else printf("YES\n");

    }

    return ;

}