{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"\u003cp\u003efdfdfd\u003c/p\u003e\u003cp\u003efdfdfd\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003eEach line of input will contain two positive integers, L and U, with L \u0026lt; U. The difference between L and U will not exceed 1,000,000. \u003c/div\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cdiv class\u003d\"ptx\" lang\u003d\"en-US\"\u003eFor each L and U, the output will either be the statement that there are no adjacent primes (because there are less than two primes between the two given numbers) or a line giving the two pairs of adjacent primes. \u003c/div\u003e"}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e2 17\n14 17\n\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre class\u003d\"sio\"\u003e2,3 are closest, 7,11 are most distant.\nThere are no adjacent primes.\n\u003c/pre\u003e"}}]}