Module Expr Str Assign NameStore Str ClassDef bases NameLoad body FunctionDef arguments args NameParam NameParam defaults body Expr Str Assign TupleStore NameStore NameStore NameLoad Assign NameStore Num Assign NameStore BinOpPow NameLoad Num For NameStore Call NameLoad Num BinOpAdd Call NameLoad NameLoad Num body Assign NameStore Num Assign NameStore BinOpAdd Call NameLoad NameLoad Num While CompareLtE NameLoad NameLoad body Assign NameStore BinOpDiv BinOpAdd NameLoad NameLoad Num If CompareEq BinOpAdd BinOpMult NameLoad NameLoad BinOpMult NameLoad NameLoad NameLoad body If BoolOpOr CompareEq NameLoad Num CompareEq NameLoad Num body AugAssignAdd NameStore Num orelse AugAssignAdd NameStore Num If CompareGt NameLoad NameLoad body Return Str Break orelse If CompareLt BinOpAdd BinOpMult NameLoad NameLoad BinOpMult NameLoad NameLoad NameLoad body Assign NameStore BinOpAdd NameLoad Num orelse Assign NameStore BinOpSub NameLoad Num If CompareGt NameLoad NameLoad body Return Str Return Str decorator_list decorator_list If CompareEq NameLoad Str body Import alias Assign NameStore Call NameLoad Str Str Assign NameStore Call NameLoad Call AttributeLoad Call AttributeLoad NameLoad attr attr For NameStore Call NameLoad NameLoad body Assign NameStore Call NameLoad NameLoad Call AttributeLoad Call AttributeLoad Call AttributeLoad NameLoad attr attr attr Str Assign NameStore BinOpMod Str Call AttributeLoad Call NameLoad attr NameLoad Print NameLoad
N/A N/A 
Problem Statement

Roy lives in a city that is circular in shape on a 2D plane. The city center is located at origin (0,0) and it has
suburbs lying on the lattice points (points with integer coordinates). The city Police Department Headquarters can only
protect those suburbs which are located strictly inside the city. The suburbs located on the border of the city are
still unprotected. So the police department decides to build at most k additional police stations at some suburbs. Each
of these police stations can protect the suburb it is located in.

Given the radius of the city, Roy has to determine if it is possible to protect all the suburbs.

Input Format
The first line of input contains integer t, t testcases follow.
Each of next t lines contains two space separated integers: r, the square of the radius of the city and k, the maximum
number of police stations the headquarters is willing to build.
 N/A __author__ Danyang Solution N/A object N/A solve N/A N/A self cipher N/A N/A N/A 
        Boarder detection
        Binary search for coordinates.

        Python time out, use C++ instead.
        :param cipher: the cipher
         N/A N/A r2 k cipher N/A required 0 N/A r N/A r2 0.5 N/A x N/A xrange 0 N/A N/A int r 1 N/A N/A low 0 N/A high N/A N/A int r 1 N/A N/A low high N/A N/A mid N/A N/A low high 2 N/A N/A N/A N/A x x N/A mid mid r2 N/A N/A N/A N/A mid 0 N/A x 0 N/A N/A required 2 N/A N/A required 4 N/A N/A required k N/A N/A impossible N/A N/A N/A N/A N/A N/A x x N/A mid mid r2 N/A N/A low N/A mid 1 N/A N/A high N/A mid 1 N/A N/A required k N/A N/A impossible N/A possible N/A N/A N/A N/A __name__ __main__ N/A N/A sys N/A f N/A open 1.in r N/A testcases N/A int N/A N/A N/A N/A f readline strip N/A t N/A xrange testcases N/A N/A cipher N/A map int N/A N/A N/A N/A N/A N/A f readline strip split N/A s N/A %s
 N/A N/A N/A Solution solve cipher N/A s