## GUPTA MECHANICAL

IN THIS WEBSITE I CAN TELL ALL ABOUT TECH. TIPS AND TRICKS APP REVIEWS AND UNBOXINGS ALSO TECH. NEWS .............

## [Solution] Sanae and Giant Robot Codeforces Solution | Codeforces Problem Solution 2022

F. Sanae and Giant Robot
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Sanae made a giant robot — Hisoutensoku, but something is wrong with it. To make matters worse, Sanae can not figure out how to stop it, and she is forced to fix it on-the-fly.

The state of a robot can be represented by an array of integers of length $n$. Initially, the robot is at state $a$. She wishes to turn it into state $b$.

As a great programmer, Sanae knows the art of copy-and-paste. In one operation, she can choose some segment from given segments, copy the segment from $b$ and paste it into the same place of the robot, replacing the original state there. However, she has to ensure that the sum of $a$ does not change after each copy operation in case the robot go haywire. Formally, Sanae can choose segment $\left[l,r\right]$ and assign ${a}_{i}={b}_{i}$ ($l\le i\le r$) if $\sum _{i=1}^{n}{a}_{i}$ does not change after the operation.

Determine whether it is possible for Sanae to successfully turn the robot from the initial state $a$ to the desired state $b$ with any (possibly, zero) operations.

Input

Each test contains multiple test cases. The first line contains a single integer $t$ ($1\le t\le 2\cdot {10}^{4}$) — the number of test cases. The descriptions of the test cases follow.

The first line of each test case contains two integers $n$$m$ ($2\le n\le 2\cdot {10}^{5}$$1\le m\le 2\cdot {10}^{5}$) — the length of $a$$b$ and the number of segments.

The second line contains $n$ intergers ${a}_{1},{a}_{2},\dots ,{a}_{n}$ ($1\le {a}_{i}\le {10}^{9}$) — the initial state $a$.

The third line contains $n$ intergers ${b}_{1},{b}_{2},\dots ,{b}_{n}$ ($1\le {b}_{i}\le {10}^{9}$) — the desired state $b$.

Then $m$ lines follow, the $i$-th line contains two intergers ${l}_{i},{r}_{i}$ ($1\le {l}_{i}<{r}_{i}\le n$) — the segments that can be copy-pasted by Sanae.

It is guaranteed that both the sum of $n$ and the sum of $m$ over all test cases does not exceed $2\cdot {10}^{5}$.

Output

For each test case, print "YES" (without quotes) if $a$ can be turned into $b$, or "NO" (without quotes) otherwise.

You can output "YES" and "NO" in any case (for example, strings "yEs", "yes" and "Yes" will be recognized as a positive response).