{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"\u003cp\u003e\nRam wants to generate some prime numbers for his cryptosystem. Help him please!\nYour task is to generate all prime numbers between two given numbers.\n\u003c/p\u003e\n\n\u003c/pre\u003e\n\u003cb\u003eWarning: large Input/Output data, be careful with certain languages (though most should be OK if the algorithm is well designed)\u003c/b\u003e"}},{"title":"Input Format","value":{"format":"MD","content":"\u003cp\u003e\nThe first line contains t, the number of test cases (less then or equal to 10). \n\nFollowed by t lines which contain two numbers m and n (1 \u003c\u003d m \u003c\u003d n \u003c\u003d 1000000000, n-m\u003c\u003d100000) separated by a space.\n\u003c/p\u003e\n"}},{"title":"Output Format","value":{"format":"MD","content":"\u003cp\u003eFor every test case print all prime numbers p such that m \u003c\u003d p \u003c\u003d n,\none number per line. Separate the answers for each test case by an empty line.\u003c/p\u003e\n"}},{"title":"Constraints","value":{"format":"MD","content":"(1 \u003c\u003d m \u003c\u003d n \u003c\u003d 1000000000, n-m\u003c\u003d100000)"}},{"title":"Sample 1","value":{"format":"MD","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e2\n1 10\n3 5\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e2\n3\n5\n7\n\n\n3\n5\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}