def find(n): a = input().split() a = [ int(x) for x in a] #找到最小的数 minx = a[0] for i in range(1,n): #共n-1个 if a[i]<minx: minx = a[i] # print(minx) #找到第2小的数 secondMin = 888 for i in range(n): if a[i]<secondMin and a[i]!=minx: secondMin = a[i] if secondMin == 888: print("NO") else: print(secondMin) m = int(input()) for x in range(m): n = int(input()) find(n)