func_code_string: // Problem: A. Dungeon   // Contest: Codeforces - Educational Codeforces Round 100 (Rated for Div. 2)   // URL: https://codeforces.com/problemset/problem/1463/A   // Memory Limit: 256 MB   // Time Limit: 2000 ms   //    // Powered by CP Editor (https://cpeditor.org)      #include<bits/stdc++.h>   using namespace std;   #pragma GCC optimize( O2 )   #define M 1000000007   #define ll long long int   #define pb push_back      #define pf push_front   #define all(x) x.begin(), x.end()   #define pob pop_back   #define pof pop_front   #define debug1(x) cout<<#x<<   <<x<<endl;   #define debug2(x,y) cout<<#x<<   <<x<<     <<#y<<   <<y<<endl;   #define debug3(x,y,z) cout<<#x<<   <<x<<     <<#y<<   <<y<<     <<#z<<   <<z<<endl;   #define present(c,x) ((c).find(x) != (c).end())   #define null NULL   #define mp make_pair   #define sz(x) (ll)x.size()   #define fi first   #define se second   #define boost ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);   #define inf 1e18   //#define endl   n    //unsigned seed = std::chrono::system_clock::now().time_since_epoch().count();   //shuffle (foo.begin(), foo.end(), std::default_random_engine(seed));   #define ordered_set tree<ll, null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>   typedef pair<int, int>  pii;   #define pi (3.14159265358979323846264338327950288)   template<typename T>   void printv(const T& t) {       std::copy(t.cbegin(), t.cend(), std::ostream_iterator<typename T::value_type>(std::cout,  ,  ));       cout<<endl;   }   ll modpower(ll a,ll b,ll c)   {    ll res=1;    while(b)    {     if(b&1LL)      res=(res*a)%c;     a=(a*a)%c;     b>>=1;    }    return res;   }   //-------------------------------Template--Above-----------------------------------------------   void solve(){    vector<ll>v(3);    for(ll i=0;i<3;i++)    cin>>v[i];    sort(all(v));    ll sum=v[0]+v[1]+v[2];    if(sum%9!=0){     cout<< NO <<endl;     return;    }    if(v[0]<sum/9){     cout<< NO <<endl;     return;    }    cout<< YES <<endl;       return;   }   int main()   {       boost       ll t;      // t=1;       cin>>t;       while(t--){           solve();       }       return 0;   }   