def findTriangle(arr):
    n = len(arr)
    arr.sort()
    count = 0
    for i in range(0,n-2):
        for j in range(i+1,n-1):
            k = j+1
            if arr[i] + arr[j] > arr[k]:
                return (arr[i], arr[j], arr[k])
    return None

print(findTriangle([1, 2, 4, 5, 8, 10, 15]))
print(findTriangle([0, 0, 0, 0, 0]))