Simple Polygon

Given $n$ simple polygons, no two polygons has common points but one polygon can strictly be inside the other. You are asked to answer $q$ queries of two kinds: $1$ $x$ $y$: add a point at position $(x, y)$. $2$ $u$: output the number of points inside or on boundary of $u$-th polygon. ###Input: - First line will contain $T$, number of testcases. Then the testcases follow. - Each test case is d