{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"\u003cp\u003e\n\tThree numbers \u003cb\u003eA\u003c/b\u003e, \u003cb\u003eB\u003c/b\u003e and \u003cb\u003eC\u003c/b\u003e are the inputs. Write a program to find second largest among them.\n\u003c/p\u003e\n"}},{"title":"Input Format","value":{"format":"MD","content":"The first line contains an integer \u003cb\u003eT\u003c/b\u003e, the total number of testcases. Then \u003cb\u003eT\u003c/b\u003e lines follow, each line contains three integers \u003cb\u003eA\u003c/b\u003e, \u003cb\u003eB\u003c/b\u003e and \u003cb\u003eC\u003c/b\u003e. "}},{"title":"Output Format","value":{"format":"MD","content":"\u003cp\u003eFor each test case, display the second largest among \u003cb\u003eA\u003c/b\u003e, \u003cb\u003eB\u003c/b\u003e and \u003cb\u003eC\u003c/b\u003e, in a new line.\u003c/p\u003e"}},{"title":"Constraints","value":{"format":"MD","content":"\u003cul\u003e\u003cli\u003e1 \u003cb\u003e≤\u003c/b\u003e \u003cb\u003eT\u003c/b\u003e \u003cb\u003e≤\u003c/b\u003e 1000\u003c/li\u003e\n\u003cli\u003e1 \u003cb\u003e≤\u003c/b\u003e \u003cb\u003eA,B,C\u003c/b\u003e \u003cb\u003e≤\u003c/b\u003e 1000000\u003c/li\u003e\n\u003c/ul\u003e"}},{"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\u003e3 \n120 11 400\n10213 312 10\n10 3 450\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e120\n312\n10\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}