find_all_pairs_given_sum.py

class Solution:
    def allPairs(self, A, B, N, M, X):

        result = []
        for i in A:
            complement = X - i
            if complement in B:
                result.append((i, complement))

        if len(result) == 0:
            return []
        else:
            result.sort()
            return result


# Driver Code
def main():

    T = int(input())

    while (T > 0):
        sz = [int(x) for x in input().strip().split()]
        N, M, X = sz[0], sz[1], sz[2]
        A = [int(x) for x in input().strip().split()]
        B = [int(x) for x in input().strip().split()]
        ob = Solution()
        answer = ob.allPairs(A, B, N, M, X)
        sz = len(answer)

        if sz == 0:
            print(-1)
        else:
            for i in range(sz):
                if i == sz-1:
                    print(*answer[i])
                else:
                    print(*answer[i], end=', ')

        T -= 1


if __name__ == "__main__":
    main()