{"trustable":true,"prependHtml":"\u003cscript\u003e window.katexOptions \u003d { disable: true }; \u003c/script\u003e\n\u003cscript type\u003d\"text/x-mathjax-config\"\u003e\n MathJax.Hub.Config({\n tex2jax: {\n inlineMath: [[\u0027$$$\u0027,\u0027$$$\u0027], [\u0027$\u0027,\u0027$\u0027]],\n displayMath: [[\u0027$$$$$$\u0027,\u0027$$$$$$\u0027], [\u0027$$\u0027,\u0027$$\u0027]]\n }\n });\n\u003c/script\u003e\n\u003cscript async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS-MML_HTMLorMML\" type\u003d\"text/javascript\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"HTML","content":"\u003cdiv class\u003d\"panel_content\"\u003eZZX has a sequence of boxes numbered $1,2,...,n$. Each box can contain at most one ball.\u003cbr\u003e\u003cbr\u003eYou are given the initial configuration of the balls. For $1 \\leq i \\leq n$, if the $i$-th box is empty then $a[i]\u003d0$, otherwise the i-th box contains exactly one ball, the color of which is a[i], a positive integer. Balls with the same color cannot be distinguished.\u003cbr\u003e\u003cbr\u003eHe will perform m operations in order. At the i-th operation, he collects all the balls from boxes l[i],l[i]+1,...,r[i]-1,r[i], and then arbitrarily put them back to these boxes. (Note that each box should always contain at most one ball)\u003cbr\u003e\u003cbr\u003eHe wants to change the configuration of the balls from a[1..n] to b[1..n] (given in the same format as a[1..n]), using these operations. Please tell him whether it is possible to achieve his goal.\u003cbr\u003e\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"First line contains an integer t. Then t testcases follow. \u003cbr\u003eIn each testcase: First line contains two integers n and m. Second line contains a[1],a[2],...,a[n]. Third line contains b[1],b[2],...,b[n]. Each of the next m lines contains two integers l[i],r[i].\u003cbr\u003e\u003cbr\u003e1\u0026lt;\u003dn\u0026lt;\u003d1000,0\u0026lt;\u003dm\u0026lt;\u003d1000, sum of n over all testcases \u0026lt;\u003d2000, sum of m over all testcases \u0026lt;\u003d2000.\u003cbr\u003e\u003cbr\u003e0\u0026lt;\u003da[i],b[i]\u0026lt;\u003dn.\u003cbr\u003e\u003cbr\u003e1\u0026lt;\u003dl[i]\u0026lt;\u003dr[i]\u0026lt;\u003dn."}},{"title":"Output","value":{"format":"HTML","content":"For each testcase, print \"Yes\" or \"No\" in a line."}},{"title":"Sample","value":{"format":"HTML","content":"\u003ctable class\u003d\u0027vjudge_sample\u0027\u003e\n\u003cthead\u003e\n \u003ctr\u003e\n \u003cth\u003eInput\u003c/th\u003e\n \u003cth\u003eOutput\u003c/th\u003e\n \u003c/tr\u003e\n\u003c/thead\u003e\n\u003ctbody\u003e\n \u003ctr\u003e\n \u003ctd\u003e\u003cpre\u003e5\r\n4 1\r\n0 0 1 1\r\n0 1 1 1\r\n1 4\r\n4 1\r\n0 0 1 1\r\n0 0 2 2\r\n1 4\r\n4 2\r\n1 0 0 0\r\n0 0 0 1\r\n1 3\r\n3 4\r\n4 2\r\n1 0 0 0\r\n0 0 0 1\r\n3 4\r\n1 3\r\n5 2\r\n1 1 2 2 0\r\n2 2 1 1 0\r\n1 3\r\n2 4\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eNo\r\nNo\r\nYes\r\nNo\r\nYes\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}