Given m pairs of integers each between 1 and n, decide whether there exist two integers x < y such that every pair contains x or y (n and m up to 300,000).