Suiting Weavers

Willy the Weaver desperately hopes to marry Wilmar, the most beautiful and delightful female weaver. Of course, Willy is not the only weaver interested in Wilmar.

To impress the females, weavers build elaborately woven nests from leaf fibers. Tomorrow is the big day, when Wilmar will inspect the nests in the hours before sunrise. A storm will produce many piles of leaf fibers, so every weaver will have a chance to improve its nest. Willy therefore wonders whether he can weave the most impressive nest, so that Wilmar finally decides to marry him. Since size matters, Willy tries to figure out how large his nest and those of his rivals may become.

For this, Willy considers all known places offering leaf fibers suitable for nest construction. Since weavers do not like to leave their known territory, many of these places can be accessed by only a subset of the weavers, and some might not be reachable by any weaver at all.

To keep things simple, Willy does not set up a flight plan. This means he does not consider any particular strategy of his rivals, nor does he make assumptions about how many fibers they can carry at a time or how fast and when they fly. It is therefore possible that a weaver picks up all the fibers in his territory. Finally, Willy assumes that all weavers are as honest as he is: they do not steal fibers from the nests of their rivals.

Is there any chance that, after all the leaf fibers have been picked up, no weaver will have a larger nest (in number of fibers) than Willy?

The first line contains the number of test cases $T$ ($1 \le T \le 100$).

Each test case starts with a line containing two integers. The first integer $W$ ($1 \le W \le 100$) is the number of weavers (including Willy); the second, $P$ ($1 \le P \le 400$), is the number of places with leaf fibers.

Next come $W$ lines describing the nest of each weaver with four integers $x$, $y$, $f$, and $r$ ($0 \le x, y, r \le 10{,}000$, $1 \le f \le 10{,}000$): $x$ and $y$ give the position of the nest, $f$ is the size of the nest in number of fibers, and $r$ is the radius of the territory in which the owner of the nest searches for additional fibers. A weaver can pick up the fibers at any place whose distance from its nest is at most $r$. The first of these $W$ lines describes Willy's nest.

Thereafter follow $P$ lines defining the places with available leaf fibers with three integers $x$, $y$, and $f$ ($0 \le x, y \le 10{,}000$, $1 \le f \le 10{,}000$): $x$ and $y$ give the position of the place, and $f$ is the number of available leaf fibers there.

For each test case, print a single line containing Suiting Success if Willy has a chance to marry Wilmar after all fibers have been picked up (a tie in nest size is sufficient); otherwise print Lonesome Willy.