hackerrank ice cream parlor
# you require like no knowledge of topics like
# enumerate, binary search, sorted
n = int(input())
for _ in range(n):
m = int(input())
arrn = int(input())
arr = list(map(int, input().split()))
for i in range(len(arr)):
for j in range(i, len(arr)):
if arr[i] + arr[j] == m:
if i != j:
print(i+1, j+1)
break
# after going through various concepts
# i coded out this simple soulution which was the easiest thing
# and realized that it was quite easy than i thought