{"trustable":false,"sections":[{"title":"","value":{"format":"HTML","content":"给你一个N元素的数组,下标从1到N,现在要查询从I到J的最小值\n "}},{"title":"Input","value":{"format":"HTML","content":" \n \u003cp class\u003d\"MsoNormal\"\u003eInput starts with an integer \u003cb\u003eT (\u003c/b\u003e\u003cb\u003e≤ 5)\u003c/b\u003e, denoting the number of test cases.\u003c/p\u003e \n \u003cp class\u003d\"MsoNormal\"\u003eThe first line of a case is a blank line. The next line contains two integers \u003cb\u003eN (1 ≤ N ≤ 10\u003csup\u003e5\u003c/sup\u003e)\u003c/b\u003e, \u003cb\u003eq (1 ≤ q ≤ 50000)\u003c/b\u003e. The next line contains \u003cb\u003eN\u003c/b\u003e space separated integers forming the array. There integers range in \u003cb\u003e[0, 10\u003csup\u003e5\u003c/sup\u003e]\u003c/b\u003e.\u003c/p\u003e \n \u003cp class\u003d\"MsoNormal\"\u003eThe next \u003cb\u003eq\u003c/b\u003e lines will contain a query which is in the form \u003cb\u003eI J (1 ≤ I ≤ J ≤ N)\u003c/b\u003e.\u003c/p\u003e \n "}},{"title":"Output","value":{"format":"HTML","content":" \n \u003cp class\u003d\"MsoNormal\"\u003eFor each test case, print the case number in a single line. Then for each query you have to print a line containing the minimum value between index \u003cb\u003eI\u003c/b\u003e and \u003cb\u003eJ\u003c/b\u003e.\u003c/p\u003e \n "}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e\n2\n \n5 3\n78 1 22 12 3\n1 2\n3 5\n4 4\n \n1 1\n10\n1 1\n\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003e\nCase 1:\n1\n3\n12\nCase 2:\n10\n\u003c/pre\u003e"}},{"title":"Note","value":{"format":"HTML","content":" \n \u003cp class\u003d\"MsoNormal\"\u003eDataset is huge. Use faster I/O methods.\u003c/p\u003e \n "}}]}