Searchlights

**English**RU

How many vertices of the regular polygons can you see in the light?

You are given two lists as input values (a list of the regular polygons and a list of the circles.)

Detail of the regular polygon (as a tuple of 4 integers):

- x coordinate of the top vertex.
- y coordinate of the top vertex.
- The length of an edge.
- The number of vertices.

Detail of the circle (as a tuple of 3 integers):

- x coordinate of the center.
- y coordinate of the center.
- The length of the radius.

You have to return the number of vertices in the circles.

**NOTE:**

- The Regular polygons is vertical symmetry.
- Don't count vertices with negative coordinates. (e.g. (-1, 2), (2, -3), (-3, -4))
- No test case where the circumference is close to the vertices.

**Example:**

searchlights([(2, 3, 2, 3)], [(1, 2, 1)]) == 1 # regular triangle searchlights([(4, 5, 2, 4)], [(4, 4, 3)]) == 4 # square

**Input: **two arguments:

- The regular polygons (a list of tuples of 4 integers)
- The circles (a list of tuples of 3 integers)

**Output: **
The number of vertices (an integer).

**Precondition:**

- length of edge ≥ 1
- length of radius ≥ 1
- Regular polygons doesn't have any common vertex.

**How it is used:**
To draw a regular polygon.