Form a Triangle Problem Statement

You are given an array of integers ARR with a length of N. Your task is to determine whether it's possible to construct at least one non-degenerate triangle using the values from the array as the sides of the triangle. If possible, return true; otherwise, return false.

Input:

The first line contains a single integer 'T' denoting the number of test cases.
 For each test case:
 The first line contains a single integer 'N' denoting the number of elements in the array.
 The second line contains 'N' space-separated integers denoting the elements of the array.

Output:

For each test case, return "YES" if it is possible to form a non-degenerate triangle, otherwise return "NO". Each test case output should be printed on a separate line.

Example:

Input:

2
 3
 3 4 5
 4
 1 10 12 30

Output:

YES
 NO

Constraints:

• 1 ≤ T ≤ 100
• 3 ≤ N ≤ 10^3
• 0 ≤ ARR[i] ≤ 10^9

Note:

You are not required to print anything since this is already managed by the system. Your goal is to implement the functionality that returns the correct result.