Planar Graph

There are $n$ base points on the plane, with some segments connecting them. Every two base points are distinct, no three base points are collinear, and segments only intersect at their endpoints. There are also $m$ source points on the plane. Each source point is different from all $n$ base points and does not lie on any segment. For each segment, determine whether you can draw a curve from some source point to the midpoint of that segment without intersecting any other segment.

The first line contains three integers $n$, $m$, $e$ ($1 \le n, m \le 100$; $0 \le e \le 300$). Each of the next $n$ lines contains two integers $x$, $y$ ($|x|, |y| \le 10^9$), the coordinates of a base point. Each of the next $m$ lines contains two integers $x$, $y$ ($|x|, |y| \le 10^9$), the coordinates of a source point. Each of the last $e$ lines contains two integers $i$, $j$ ($1 \le i < j \le n$), meaning the segment connects the $i$-th and $j$-th base points.

Print a string of length $e$. The $i$-th character is "1" if some source point has a curve to the midpoint of the $i$-th segment that does not intersect any other segment, and "0" otherwise.