Hiring Help

A certain large unnamed software development company has $n$ developers. The productivity of each coder is measured by two performance indicators: the number of lines of code they write per hour, and the number of bugs they fix per hour.

When a project needs to be done, the manager in charge of the project is allocated a budget of $t$ man-hours of programmer time. The manager can staff different coders on the project, up to a total of $t$ hours. For instance, if there are three programmers, the manager can allocate any non-negative real numbers $t_1$, $t_2$, and $t_3$ hours of their respective work hours, as long as $t_1 + t_2 + t_3 \le t$. If the three programmers write $l_1$, $l_2$, and $l_3$ lines of code per hour, a total of $t_1 \cdot l_1 + t_2 \cdot l_2 + t_3 \cdot l_3$ lines of code will be written for the project. Similarly, if they fix $b_1$, $b_2$, and $b_3$ bugs per hour, a total of $t_1 \cdot b_1 + t_2 \cdot b_2 + t_3 \cdot b_3$ bugs will be fixed.

The company has a hiring freeze, so no new coders are hired. A manager may bring in outside help by outsourcing a project to an external consultant, but only if the project cannot be done equally efficiently in-house. If the consultant writes $\ell$ lines of code and fixes $b$ bugs in $t$ hours, and some allocation of the existing coders would write at least $\ell$ lines of code and fix at least $b$ bugs in at most $t$ hours, then the manager is not allowed to hire this consultant. This holds regardless of whether those coders have time for the project or are already busy with other projects.

Employees sometimes quit the company during the freeze. Given a chronological list of events, consultant requests and employees quitting, find out which of the requests will be approved.

The first line contains a single integer $n$ ($0 \leq n \leq 2 \cdot 10^5$), the number of coders at the start. The coders are numbered from $1$ to $n$. The next $n$ lines each contain two integers $\ell_i$ and $f_i$ ($1 \leq \ell_i, f_i \leq 10^8$), the lines of code and the bugs fixed per hour by coder $i$.

The next line contains a single integer $e$ ($1 \leq e \leq 10^5$), the number of events. Each of the following $e$ lines is one of two forms:

• "c $t$ $\ell$ $f$", for integers $t$, $\ell$, and $f$ ($1 \leq t \leq 100$, $1 \leq \ell, f \leq 10^8$): a request to take in a consultant for a project of $t$ hours, where the consultant would write $\ell$ lines of code and fix $f$ bugs in those $t$ hours.
• "q $i$", for an integer $i$ ($1 \leq i \leq n$): coder $i$ quit the company.

No coder quits more than once.

For each consultant request, output "yes