s = int(input())
sss = []
for i in range(s):
a,b,c = map(int,input().split())
r = (a+b+c)//9
if (a+b+c)%9 == 0 and a >= r and b >= r and c >=r:
sss.append('YES')
else:
sss.append('NO')
print(*sss,sep = '\n')
#include<bits/stdc++.h>
#define ll long long
#define VL vector<ll>
#define loop(i, n) for(int i=0 ; i< n; i++)
using namespace std;
const ll MAX=1e9+10;
//ll binaryExponent(int a , int n){
// if(n==1) return a;
// if(n==0) return 1;
// ll r=binaryExponent(a, n/2);
// r*=r;
// if(n%2==0){
//
// return r;
// }else{
// return (r*a);
// }
//
//
//}
void solve(){
ll a, b, c;
cin>>a>>b>>c;
ll sum=a+b+c;
ll m=min(a, b);
m=min(m ,c);
if(sum%9!=0){
cout<<"NO\n";
}else{
if(m<sum/9) cout<<"NO\n";
else cout<<"YES\n";
}
}
int main(){
int t;t=1;
cin>>t;
while(t--) solve();
return 0;
}1373D - Maximum Sum on Even Positions | 1574C - Slay the Dragon |
621A - Wet Shark and Odd and Even | 1395A - Boboniu Likes to Color Balls |
1637C - Andrew and Stones | 1334B - Middle Class |
260C - Balls and Boxes | 1554A - Cherry |
11B - Jumping Jack | 716A - Crazy Computer |
644A - Parliament of Berland | 1657C - Bracket Sequence Deletion |
1657B - XY Sequence | 1009A - Game Shopping |
1657A - Integer Moves | 230B - T-primes |
630A - Again Twenty Five | 1234D - Distinct Characters Queries |
1183A - Nearest Interesting Number | 1009E - Intercity Travelling |
1637B - MEX and Array | 224A - Parallelepiped |
964A - Splits | 1615A - Closing The Gap |
4C - Registration System | 1321A - Contest for Robots |
1451A - Subtract or Divide | 1B - Spreadsheet |
1177A - Digits Sequence (Easy Edition) | 1579A - Casimir's String Solitaire |