answer = False
sort(A)
for i=1 to n
    for j=1 to n
        found = BinarySearch(t-A[i]-A[j])
        if found!=-1
            answer = True
return answer