// Long Challenge
#pragma Gpref optimize("O3")
//#pragma Gpref optimize("Ofast")
//#pragma Gpref target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma Gpref optimize("unroll-loops")
#include <bits/stdc++.h>
#define int long long
#define IOS ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
#define FR(i,j,k) for(int i=j; i<k; i++)
#define TC int T; cin >> T; FR(t,0,T)
#define BFR(i,j,k) for(int i=j; i>=k; --i)
#define pb push_back
#define imie(...) " [" << #__VA_ARGS__ ": " << (__VA_ARGS__) << "] "
#define go continue
#define F first
#define S second
using namespace std;
const int MOD = (int)1e9+7;
const int N = 1e5+5;
int32_t main(){
IOS;
TC{
int a, b, c;
cin >> a >> b >> c;
int sum = a + 2*b + 3*c;
cout << ((sum % 9 == 0)?"YES":"NO" << '\n';
}
return 0;
}
Ly8gTG9uZyBDaGFsbGVuZ2UKCiNwcmFnbWEgR3ByZWYgb3B0aW1pemUoIk8zIikKLy8jcHJhZ21hIEdwcmVmIG9wdGltaXplKCJPZmFzdCIpCi8vI3ByYWdtYSBHcHJlZiB0YXJnZXQoInNzZSxzc2UyLHNzZTMsc3NzZTMsc3NlNCxwb3BjbnQsYWJtLG1teCxhdngsdHVuZT1uYXRpdmUiKQovLyNwcmFnbWEgR3ByZWYgb3B0aW1pemUoInVucm9sbC1sb29wcyIpCiNpbmNsdWRlIDxiaXRzL3N0ZGMrKy5oPgojZGVmaW5lIGludCBsb25nIGxvbmcKI2RlZmluZSBJT1MgaW9zX2Jhc2U6OnN5bmNfd2l0aF9zdGRpbyhmYWxzZSk7Y2luLnRpZShOVUxMKTtjb3V0LnRpZShOVUxMKTsKI2RlZmluZSBGUihpLGosaykgZm9yKGludCBpPWo7IGk8azsgaSsrKQojZGVmaW5lIFRDIGludCBUOyBjaW4gPj4gVDsgRlIodCwwLFQpCiNkZWZpbmUgQkZSKGksaixrKSBmb3IoaW50IGk9ajsgaT49azsgLS1pKQojZGVmaW5lIHBiIHB1c2hfYmFjawojZGVmaW5lIGltaWUoLi4uKSAiIFsiIDw8ICNfX1ZBX0FSR1NfXyAiOiAiIDw8IChfX1ZBX0FSR1NfXykgPDwgIl0gIgojZGVmaW5lIGdvIGNvbnRpbnVlCiNkZWZpbmUgRiBmaXJzdAojZGVmaW5lIFMgc2Vjb25kCnVzaW5nIG5hbWVzcGFjZSBzdGQ7CiAKY29uc3QgaW50IE1PRCA9IChpbnQpMWU5Kzc7CmNvbnN0IGludCBOID0gMWU1KzU7CgppbnQzMl90IG1haW4oKXsKSU9TOwoKVEN7CglpbnQgYSwgYiwgYzsKCWNpbiA+PiBhID4+IGIgPj4gYzsKCWludCBzdW0gPSBhICsgMipiICsgMypjOwoJY291dCA8PCAoKHN1bSAgJSA5ID09IDApPyJZRVMiOiJOTyIgPDwgJ1xuJzsKCn0KCXJldHVybiAwOwp9Cgo=