Given two arrays $A$ and $B$, both of them have $n$ elements. Then there are $m$ queries, each of which contains four integers: $L$, $R$, $x$, $y$. For each query, you are required to count different indexes $k \in [L, R]$, that satisfy $A[k] \geq x$ and $B[k] \geq y$.
输入格式
The first line contains an integer number T, the number of test cases.
For each test case : The first line contains two integers $n$, $m$($1 \leq n, m \leq 10^{5}$).
The second line contains $n$ integers $A[i]$($1 \leq A[i] \leq 10^{5}$).
The third line contains $n$ integers $B[i]$($1 \leq B[i] \leq 10^{5}$).
i-th of each next $m$ lines contains four integers $L$, $R$, $x$, $y$($1 \leq L \leq R \leq n, 1 \leq x, y \leq 10^{5}$).
