EDF

Minku has so much work this year that $N$ jobs have piled up, and up to $M$ more jobs are added over time.

Each existing job is given its required time $t_i$ and deadline $d_i$. Each added job is given its arrival time $w_j$, required time $t_j$, and deadline $d_j$.

Minku starts with the job whose deadline is closest. If a newly added job has an earlier deadline than the job he is working on, he switches to the new job. The interrupted job keeps its progress: its required time is reduced by the time already spent on it, so he can resume it later.

For example, if a job that requires 20 minutes has been worked on for 15 minutes before he switches, he needs only 5 more minutes to finish it.

If two jobs have the same deadline, he does the one with less remaining required time first.

Determine whether Minku can finish all $N + M$ jobs by following this process. Minku focuses on one thing at a time, so he can work on only one job at once. He keeps working until all $N + M$ jobs are finished.

The current time is $0$ seconds.

The first line contains the number of jobs $N$. ($1 \le N \le 10^5$)

Each of the next $N$ lines contains the required time $t_i$ and deadline $d_i$ of a job. ($0 \le t_i \le 10^9$, $1 \le d_i \le 10^9$, $t_i \le d_i$)

On the $(N + 2)$-th line, the number of jobs $M$ that are added during the process is given. ($1 \le M \le N$)

Each of the next $M$ lines contains the arrival time $w_j$, required time $t_j$, and deadline $d_j$ of an added job. ($0 \le t_j \le 10^9$, $1 \le w_j, d_j \le 10^9$, $w_j + t_j \le d_j$)

On the first line, print NO if Minku cannot finish all jobs. Print YES if he can.

If he can finish all jobs, print the earliest time at which all jobs are completed on the second line.