== include(page="template/taskheader" task_id="tri3") ==
You are given K points with positive integer coordinates. You are also given M triangles, each
of them having one vertex in the origin and the other 2 vertices with non-negative integer
coordinates.
You are asked to determine for each triangle whether it has at least one of the K given points
inside. (None of the K points are on any edge of any triangle.)
Se dau $K$ puncte cu coordonate numere intregi pozitive. De asemenea, se mai dau $M$ triunghiuri, fiecare dintre ele avand un varf in origine iar celelalte doua varfuri la coordonate numere intregi pozitive.
Determinati pentru fiecare triunghi daca are in interiorul sau cel putin unul din cele $K$ puncte date.
Niciunul dintre cele $K$ puncte nu se gaseste pe o latura a oricarui triunghi.
h2. Date de intrare
The first line of the input file $tri3.in$ will contain $K$ and $M$. The following $K$ lines will
contain 2 positive integers x y separated by one space that represent the coordinates of
each point. The next M lines have 4 non-negative integers separated by one space, (x1,y1)
and (x2, y2), that represent the other 2 vertices of each triangle, except the origin.
Prima linie a fisierului de intrare $tri3.in$ va contine $K$ si $M$. Urmatoarele $K$ linii contin cate $2$ numere intregi $x$ si $y$, separate printr-un spatiu, reprezentand coordonatele punctelor. Urmatoarele $M$ linii contin cate $4$ numere intregi pozitive, separate printr-un spatiu, $(x1,y1)$ si $(x2,y2)$, reprezentand celelalte $2$ varfuri ale triunghiului, exceptand pe cel din origine.
h2. Date de ieşire
The output file $tri3.out$ should contain exactly M lines. The k-th line should contain the
character Y if the k-th triangle (in the order of the input file) contains at least one point
inside it, or N otherwise.
h2. Restricţii
* $1 ≤ K,M ≤ 100.000$
* $1 ≤ each coordinate of the $K$ points ≤ 109$
* $0 ≤ each coordinate of the triangle vertices ≤ 109$
* $Triangles are not degenerate (they all have nonzero area).$
* $In 50% of the test cases, all triangles have vertices with coordinates x1=0 and y2=0. That is, one edge of the triangle is on the x-axis, and another is on the y-axis.$
Fisierul de iesire $tri3.out$ contine exact $M$ linii. Linia $k$ contine caracterul $Y$ daca al $k$-lea triunghi (in ordinea data in fisierul de intrare) contine cel putin un punct in interiorul sau, sau $N$ in caz contrar.
h2. Restricţii şi precizări
* $1$ ≤ $K,M$ ≤ $100.000$
* $1$ ≤ coordonatele celor $K$ puncte ≤ $109$
* $0$ ≤ coordonatele varfurilor triunghiurilor ≤ $109$
* Triunghiurile nu sunt degenerate (toate au aria diferita de $0$).
* In $50%$ din teste, toate triunghiurile au varfurile in punctele cu coordonate $x1 = 0$ si $y2 = 0$. Acest lucru inseamna ca doua din laturile triunghiului se gasesc pe axele de coordonate.
h2. Exemplu
