{"raw_statement":[{"iden":"statement","content":"While planning the SCPC2015 contest floor, each team has been assigned an area of a rectangular shape. The area covers the maximum region the team is allowed to move around during the contest.\n\nWhen Noura saw the contest floor, she didn't like the rectangular shapes. She asked the organizers to reassign each team for a square shaped area instead of a rectangular one.\n\nGiven the sides of a rectangle, help the organizers find the square with minimum area, that covers the rectangle. To make it easier for the organizers, each side of the square must be parallel to one of the sides of the rectangle.\n\nThe first line of input contains an integer T (1 ≤ T ≤ 1024), the number of test cases.\n\nEach test case contains two space-separated integers X, Y (1 ≤ X, Y ≤ 1000), the dimensions of the rectangular shaped area.\n\nFor each test case, print on a single line, the area of the square described in the problem statement.\n\nWarning: large Input/Output data, be careful with certain languages.\n\n"},{"iden":"input","content":"The first line of input contains an integer T (1 ≤ T ≤ 1024), the number of test cases.Each test case contains two space-separated integers X, Y (1 ≤ X, Y ≤ 1000), the dimensions of the rectangular shaped area."},{"iden":"output","content":"For each test case, print on a single line, the area of the square described in the problem statement."},{"iden":"examples","content":"Input33 35 712 6Output949144"},{"iden":"note","content":"Warning: large Input/Output data, be careful with certain languages."}],"translated_statement":null,"sample_group":[],"show_order":[],"formal_statement":"**Definitions**  \nLet $ T \\in \\mathbb{Z} $ be the number of test cases.  \nFor each test case $ k \\in \\{1, \\dots, T\\} $, let $ (x_k, y_k) \\in \\mathbb{Z}^2 $ denote the dimensions of a rectangle.\n\n**Constraints**  \n1. $ 1 \\le T \\le 1024 $  \n2. For each $ k $, $ 1 \\le x_k, y_k \\le 1000 $\n\n**Objective**  \nFor each test case $ k $, find the minimum area of a square with sides parallel to the rectangle that can cover it.  \nLet $ s_k = \\max(x_k, y_k) $.  \nThe area of the square is:  \n$$\ns_k^2\n$$","simple_statement":"Given a rectangle with sides X and Y, find the smallest square that can cover it, with sides parallel to the rectangle. Print the area of that square.","has_page_source":false}