#include<map>
#include<set>
#include<cmath>
#include<queue>
#include<bitset>
#include<math.h>
#include<cstdio>
#include<vector>
#include<string>
#include<cstring>
#include<iostream>
#include<algorithm>
#pragma comment(linker, "/STACK:102400000,102400000")
using namespace std;
const int N=1000010;
const int MAX=1000000100;
const int mod=100000000;
const int MOD1=1000000007;
const int MOD2=1000000009;
const double EPS=0.00000001;
typedef long long ll;
const ll MOD=998244353;
const int INF=1000000010;
typedef double db;
typedef unsigned long long ull;
int f[2005][15][35];
int fronty(int y,int m,int d) {
if (m==1&&d==1) return y-1;
return y;
}
int frontm(int y,int m,int d) {
if (d!=1) return m;
if (m!=1) return m-1;
return 12;
}
int check(int y) {
if (y%400==0) return 1;
if (y%100==0) return 0;
if (y%4==0) return 1;
return 0;
}
int getday(int y,int m) {
if (m!=2) {
if (m==1||m==3||m==5||m==7||m==8||m==10||m==12) return 31;
else return 30;
} else if (check(y)) return 29;
else return 28;
}
int frontd(int y,int m,int d) {
if (d!=1) return d-1;
if (m==1) return 31;
return getday(y,m-1);
}
int nextday(int y,int m,int d) {
if (d!=getday(y,m)) return f[y][m][d+1];
else if (m==12) return f[y+1][1][31];
else return f[y][m+1][1];
}
int bianjie(int y,int m,int d) {
if (y>2001) return 1;
if (y==2001&&m>11) return 1;
if (y==2001&&m==11&&d>4) return 1;
return 0;
}
int nextmonth(int y,int m,int d) {
if (m==12) {
if (y<2001) return f[y+1][1][d];
return -1;
}
if (d>getday(y,m+1)||bianjie(y,m+1,d)) return -1;
else return f[y][m+1][d];
}
void deal(int y,int m,int d) {
if (y<1900) return ;
int a=nextday(y,m,d);
int b=nextmonth(y,m,d);
if (a!=0&&b!=0) f[y][m][d]=0;
else if (a!=1&&b!=1) f[y][m][d]=1;
else f[y][m][d]=2;
deal(fronty(y,m,d),frontm(y,m,d),frontd(y,m,d));
}
int main()
{
int i,t,y,m,d;
deal(2001,11,3);
scanf("%d", &t);
while (t--) {
scanf("%d%d%d", &y, &m, &d);
if (f[y][m][d]) printf("YES\n");
else printf("NO\n");
}
return 0;
}