Go: package main

import (
	"bufio"
	"fmt"
	"os"
	"strconv"
)

var sc = bufio.NewScanner(os.Stdin)
var out = bufio.NewWriter(os.Stdout)

func main() {
	sc.Split(bufio.ScanWords)
	defer out.Flush()
	n := nextInt()
	for i := 0; i < n; i++ {
		data := nextInts(3)
		fmt.Fprintln(out, checkTriangle(data))
	}
}

func next() string {
	sc.Scan()
	return sc.Text()
}

func nextInt() int {
	a, _ := strconv.Atoi(next())
	return a
}

func nextInts(n int) []int {
	a := make([]int, n)
	for i := 0; i < n; i++ {
		a[i] = nextInt()
	}
	return a
}

func checkTriangle(i []int) string {
	if checkSt(i[0], i[1], i[2]) || checkSt(i[1], i[2], i[0]) || checkSt(i[2], i[0], i[1]) {
		return "YES"
	}
	return "NO"
}
func Sq(x int) int {
	return x * x
}

func checkSt(a, b, c int) bool {
	return (Sq(a) + Sq(b)) == Sq(c)
}

C++: #include <cstdio>
#include <algorithm>
using namespace std;

int main(){
	int n;
	scanf("%d", &n);
	int a[3];
	for (int i = 0; i < n; i++){
		scanf("%d %d %d", &a[0], &a[1], &a[2]);
		sort(a, a+3);
		if(a[0] * a[0] + a[1] * a[1] == a[2] * a[2]){
			printf("YES\n");
		}else{
			printf("NO\n");
		}
	}

	return 0;
}

C++: #include <iostream>
using namespace std;

int main()
{
 int n;
 int a[1000], b[1000], c[1000];

 cin >> n;
 for(int i=0; i<n; i++) cin >> a[i] >> b[i] >> c[i];

 for(int i=0; i<n; i++){
  if(a[i]*a[i] == b[i]*b[i] + c[i]*c[i] | b[i]*b[i] == a[i]*a[i] + c[i]*c[i] | c[i]*c[i] == a[i]*a[i] + b[i]*b[i]) cout << "YES\n";
  else cout << "NO\n";
 }

 return 0;
}

C++: #include <iostream>

using namespace std;

int main(void) {
	int N;
	
	cin >> N;
	for(int i = 0; i < N; i++) {
		int len[3];
		cin >> len[0] >> len[1] >> len[2];
		
		if(len[0] > len[1]) {
			int tmp = len[0];
			len[0] = len[1];
			len[1] = tmp;
		}
		if(len[1] > len[2]) {
			int tmp = len[1];
			len[1] = len[2];
			len[2] = tmp;
		}
		if(len[0] > len[1]) {
			int tmp = len[0];
			len[0] = len[1];
			len[1] = tmp;
		}
		
		if(len[2] * len[2] == len[0] * len[0] + len[1] * len[1]) {
			cout << "YES" << endl;
		} else {
			cout << "NO" << endl;
		}
	}
	return 0;
}

C++: #include<iostream>
#include<cmath>
using namespace std;

int main()
{
	int i, n;
	cin >> n;
	for (i = 1; i <= n; i++){
		int n1, n2, n3, a, b, c;
		cin >> n1 >> n2 >> n3;
		a = n1 > n2 ? n1 : n2;
		b = n1 + n2 - a;
		c = a > n3 ? a : n3;
		a= a + n3 - c;
		if (c == sqrt(a * a + b * b))
			cout << "YES\n";
		else cout << "NO\n";
	}
	return 0;
}

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

bool right(int a,int b,int c){
	return ((c*c==a*a+b*b)?1:0);
}

int main(){
	int n;
	cin>>n;
	int a[3];
	bool ans[n];
	for(int i=0;i<n;i++){
		cin>>a[0]>>a[1]>>a[2];
		sort(a,a+3);
		ans[i]=right(a[0],a[1],a[2]);
	}
	for(int i=0;i<n;i++) cout<<((ans[i])?"YES":"NO")<<endl;
	return 0;
}

C++: #include<stdio.h>
#include<algorithm>

using namespace std;

int main(){
	int n,a,b,c;
	int m=0;
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		int a[3];
		for(int j=0;j<3;j++)scanf("%d",&a[j]);
		std::sort(a,a+3);
		
		int d = 0;
		if(a[0]>d || a[1]>d || a[2]>d)puts("hogehogehoge");
		
		if(a[0]*a[0]+a[1]*a[1] == a[2]*a[2]){
			puts("YES");
		}else{
			puts("NO");
		}
	}
}

C++: #include <iostream>
using namespace std;
int main(){
    int a,b,c,n;
    cin >> n;
    for (;0<n;n--){
        cin >> a >> b >> c;
        if (a^2+b^2 == c^2)
            cout << "YES" << endl;
        else if (a^2+c^2 == b^2)
            cout << "YES" << endl;
        else if (b^2+c^2 == a^2)
            cout << "YES" << endl;
        else
            cout << "NO" << endl;
    }
}

C++: #include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;

#define EACH(i,a) for (auto& i : a)
#define FOR(i,a,b) for (ll i=(a);i<(b);i++)
#define RFOR(i,a,b) for (ll i=(b)-1;i>=(a);i--)
#define REP(i,n) for (ll i=0;i<(n);i++)
#define RREP(i,n) for (ll i=(n)-1;i>=0;i--)
#define debug(x) cout<<#x<<": "<<x<<endl
#define pb push_back
#define ALL(a) (a).begin(),(a).end()

const ll linf = 1e18;
const int inf = 1e9;
const double eps = 1e-12;
const double pi = acos(-1);

template<typename T>
istream& operator>>(istream& is, vector<T>& vec) {
    EACH(x,vec) is >> x;
    return is;
}
template<typename T>
ostream& operator<<(ostream& os, vector<T>& vec) {
    REP(i,vec.size()) {
        if (i) os << " ";
        os << vec[i];
    }
    return os;
}
template<typename T>
ostream& operator<<(ostream& os, vector< vector<T> >& vec) {
    REP(i,vec.size()) {
        if (i) os << endl;
        os << vec[i];
    }
    return os;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    ll Q; cin >> Q;
    while ( Q-- ) {
        vector<ll> len(3); cin >> len;
        sort(ALL(len));
        if (len[0] * len[0] + len[1] * len[1] == len[2] * len[2]) {
            cout << "YES" << endl;
        }
        else {
            cout << "NO" << endl;
        }
    }
}

C++: 
#include<iostream>
#include<algorithm>
#include<queue>
using namespace std;
/*
int main()
{
	int n, a, b, c;
	cin >> n;
	for (int i = 0; i < n; i++) {
		cin >> a >> b >> c;
		int m = max(a, max(b, c));
		int l = min(a, b);
		int n = min(b, c);
		if (l == n) {
			n = min(a, c);
		}
		if (m*m == n*n + l*l) {
			cout << "YES" << endl;
		}
		else {
			cout << "NO" << endl;
		}
	}
    return 0;
}

*/
int main() {
	priority_queue<int> pq;
	int n, a;
	cin >> n;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < 3; j++) {
			cin >> a;
			pq.push(a);
		}	
		int a, b, c;
		a = pq.top(); pq.pop();
		b = pq.top(); pq.pop();
		c = pq.top(); pq.pop();
		cout << (a*a == b*b + c*c ? "YES" : "NO") << endl;
	}
	return 0;
}

C++: #include<iostream>
using namespace std;

int main() {
	int a, b, c, i;
	cin >> i;
	for (int n = 0; n < i; n++) { 
		cin >> a >> b >> c; 
	if (a*a == b*b + c*c) { cout << "YES" << endl; }
	else if (b*b == a*a + c*c) { cout << "YES" << endl; }
	else if (c*c == a*a + b*b) { cout << "YES" << endl; }
	else { cout << "NO" << endl; }
	}
	return 0;
}

C++: import Control.Monad
import Data.List

main = do
  n <- readLn
  s <- map (map (read :: (String -> Int)) . words) <$> replicateM n getLine
  mapM_ putStrLn $ map (\x -> if x then "YES" else "NO") $ map (\x -> (x !! 2) ^ 2 == (x !! 0) ^ 2 + (x !! 1) ^ 2)  $ map (sort) s

C++: #include <iostream>
#include <algorithm>

using namespace std;

int main(){
    int a[3];
    while(cin >> a[0] >> a[1] >> a[2]){
        sort(a, a+3);
        if(a[0]*a[0]+a[1]*a[1] == a[2]*a[2]) cout << "YES" << endl;
        else cout << "NO" << endl;
    }
}

C++: #include<stdio.h>
int main(void)
{
	int n,i,w,a,s,d,x,j,z;
		scanf("%d",&n);
		for(i=0;i<n;i++){
			scanf("%d %d %d",&a,&s,&d);
			if(a>s&&d<a){
				w=(d*d)+(s*s);
				x=a*a;
					if(w==x){
						printf("YES\n");
					}
					else{
						printf("NO\n");
					}	
			}	
			if(a<d&&d>s){
				w=(a*a)+(s*s);
				x=d*d;
					if(w==x){
						printf("YES\n");
					}
					else{
						printf("NO\n");
					}				
			}
			if(a<s&&s>d){
				w=(d*d)+(s*s);
				x=s*s;
					if(w==x){
						printf("YES\n");
					}
					else{
						printf("NO\n");
					}				
			}
			else if(a==s&&s==d&&d==a||a==s||s==d||d==a){
				printf("NO\n");
			}	
		
		}
	return 0;
}

C++: #include <iostream>
using namespace std;


int main()
{
      int a,b,c,n,index;

      index = 0;  //????????????
      cin >> n;  //???????????°??????

      while(1)  //???????????????
      {
           cin >> a >> b >> c;       //?????????????????????

???????????????if( a*a + b*b == c*c)      //??????????????????
???                 cout >> "Yes" >> endl;
          else
                   cout >> "No" >> endl;
     
          if(index == n)
                   break;      //???????????±???

          index++;
     }

     return 0;
}