Prime Hole

We have a list of arbitrary positive integers, of length $N$. Your task is to select a positive integer $M$ such that any prime in the prime decomposition of the integers in the list doesn't exceed $M$. Now, to make this task interesting, this $M$ must be such that there always exists at least one pair in the sequence whose product is a perfect square. Since there may be multiple such numbers, you