Pythagorean Triplet 54

def pytr(n):
    for i in range(1, int(n/3)+1):
        for j in range(i+1, int(n/2)+1):
            k=n-i-j
            if (i*i + j*j == k*k):
                return [i,j,k]
a=int(input())
l=[]
for i in range(a):
    b=int(input())
    c=pytr(b) 
    l.append(c[2]**2)
[print(x,end=' ') for x in l]

Getting answer for small input but for large inputs time limit exceed.