Paper Boy Sunny is a hal sing person as he earns money to pay for his education. One day he asked is manager he wants to give papers only to first "T" nearest houses which are situated in 2D plane so that he will get time to study for his exams. Coordinates of houses are given. You have to provide the distance of Tth nearest house from Sunny's location that is origin. here are two types of input queries. For query of 1st type, you come to know about the coordinates (xy) of newly constructed house. For query of 2nd type, you have to output the distance of Tth nearest house till now. Sunny will always stay at his place (origin) for calculating distance. It is guaranteed that there will be at least T queries of type 1 before first query of type 2. Distance between two points ( x2, y2) and (x1, y1 ) is defined as (x2 - x1)^2 + (y2 - y1)^2.