{"trustable":false,"prependHtml":"\u003cstyle type\u003d\u0027text/css\u0027\u003e\n .input, .output {\n border: 1px solid #888888;\n }\n .output {\n margin-bottom: 1em;\n position: relative;\n top: -1px;\n }\n .output pre, .input pre {\n background-color: #EFEFEF;\n line-height: 1.25em;\n margin: 0;\n padding: 0.25em;\n }\n \u003c/style\u003e\n \u003clink rel\u003d\"stylesheet\" href\u003d\"//codeforces.org/s/96598/css/problem-statement.css\" type\u003d\"text/css\" /\u003e\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 type\u003d\"text/javascript\" async src\u003d\"https://mathjax.codeforces.org/MathJax.js?config\u003dTeX-AMS_HTML-full\"\u003e\u003c/script\u003e","sections":[{"title":"","value":{"format":"PLAIN","content":"作为一个算法发明家,XHK发明了一个奇怪的排序\n现在给你一个长度为n的数组\n再给你m个正整数pi,代表你可以将a[pi]与a[pi+1]交换,并且可以进行任意次\n现在问你数组是否可以在经过若干次操作成为一个不下降序列"}},{"title":"Input","value":{"format":"PLAIN","content":"多组输入,第一行为T代表样例数(T≤100)\n每组数组第一行n,m(1≤m\u003cn≤100)\n第二行n个整数为数组(1≤ai≤100)\n第三行m个整数表示有m个位置可以进行交换"}},{"title":"Output","value":{"format":"PLAIN","content":"对于每组数据如果可以则输出“YES”,不能则输出“NO”"}},{"title":"Example","value":{"format":"PLAIN","content":"输入:\n6\n2 1\n26 55\n1\n4 1\n19 42 77 29\n1\n5 2\n26 39 72 31 68\n3 2\n4 2\n91 49 94 52\n3 2\n5 1\n1 2 3 4 5\n1\n5 2\n2 1 2 3 3\n1 4\n输出:\nYES\nNO\nNO\nNO\nYES\nYES"}}]}