{"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":"HTML","content":"\u003ca href\u003d\"https://codeforces.com/problemset/problem/1380/A\"\u003eProblem Link\u003c/a\u003e"}},{"title":"","value":{"format":"HTML","content":"\u003cp\u003eYou are given a permutation $$$p_1, p_2, \\dots, p_n$$$. Recall that sequence of $$$n$$$ integers is called a \u003cspan class\u003d\"tex-font-style-it\"\u003epermutation\u003c/span\u003e if it contains all integers from $$$1$$$ to $$$n$$$ exactly once.\u003c/p\u003e\u003cp\u003eFind three indices $$$i$$$, $$$j$$$ and $$$k$$$ such that: \u003c/p\u003e\u003cul\u003e \u003cli\u003e $$$1 \\le i \u0026lt; j \u0026lt; k \\le n$$$; \u003c/li\u003e\u003cli\u003e $$$p_i \u0026lt; p_j$$$ and $$$p_j \u0026gt; p_k$$$. \u003c/li\u003e\u003c/ul\u003e Or say that there are no such indices."}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains a single integer $$$T$$$ ($$$1 \\le T \\le 200$$$)\u0026nbsp;— the number of test cases.\u003c/p\u003e\u003cp\u003eNext $$$2T$$$ lines contain test cases\u0026nbsp;— two lines per test case. The first line of each test case contains the single integer $$$n$$$ ($$$3 \\le n \\le 1000$$$)\u0026nbsp;— the length of the permutation $$$p$$$.\u003c/p\u003e\u003cp\u003eThe second line contains $$$n$$$ integers $$$p_1, p_2, \\dots, p_n$$$ ($$$1 \\le p_i \\le n$$$; $$$p_i \\neq p_j$$$ if $$$i \\neq j$$$)\u0026nbsp;— the permutation $$$p$$$.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each test case: \u003c/p\u003e\u003cul\u003e \u003cli\u003e if there are such indices $$$i$$$, $$$j$$$ and $$$k$$$, print \u003cspan class\u003d\"tex-font-style-tt\"\u003eYES\u003c/span\u003e (case insensitive) and the indices themselves; \u003c/li\u003e\u003cli\u003e if there are no such indices, print \u003cspan class\u003d\"tex-font-style-tt\"\u003eNO\u003c/span\u003e (case insensitive). \u003c/li\u003e\u003c/ul\u003e\u003cp\u003eIf there are multiple valid triples of indices, print any of them.\u003c/p\u003e"}},{"title":"Examples","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\u003e3\n4\n2 1 4 3\n6\n4 6 1 2 5 3\n5\n5 3 1 2 4\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eYES\n2 3 4\nYES\n3 5 6\nNO\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}