1.

/**
* FWP, Ausgewählte Probleme aus dem ACM Programming Contest, SS11
* Problem: 11936 - The Lazy Lumberjacks
* Link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=229&page=show_problem&problem=3087
*
* @author Burgmair Stefan
* @author YYY
* @version 1.0, 20/06/2011
*
* Method : Ad-Hoc
* Status : Accepted
* Runtime: 0.108
*/

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main
{
public static void main(String[] args) throws IOException
{
BufferedReader reader = new BufferedReader(new InputStreamReader(System.in));
String[] arr;
int nmbrOfTestCases = Integer.parseInt(reader.readLine());
int a, b, c;
for (int i = 1; i <= nmbrOfTestCases; i++){
arr = reader.readLine().split(" ");
a = Integer.parseInt(arr[0]);
b = Integer.parseInt(arr[1]);
c = Integer.parseInt(arr[2]);
if(b+c>a)
if(b+a>c)
if(a+c>b)
System.out.println("OK");
else
System.out.println("Wrong!!");
else
System.out.println("Wrong!!");
else
System.out.println("Wrong!!");


}
}
}