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

#define int long long
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)

const int M = 60;
bool dp[M + 5][M + 5][M + 5];

int solve() {
    int A, B, C;
    cin >> A >> B >> C;
    
    A %= M, B %= M, C %= M;
    cout << (dp[A][B][C] ? "Yes" : "No") << "\n";
    
    return 0;
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    
    dp[0][0][0] = 1;
    rep(i, M) rep(j, M) rep(k, M) if(dp[i][j][k]) {
    	dp[i + 1][j + 1][k + 1] = 1;
    	dp[i][j + 2][k + 1] = 1;
    	dp[i + 2][j][k + 1] = 1;
    	dp[i + 2][j + 4][k] = 1;
    	dp[i + 4][j + 2][k] = 1;
    }
    
    int Testcases = 1;
    cin >> Testcases;
    while(Testcases--) if(solve()) return 1;
    
    return 0;
}