{"trustable":true,"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":"\u003cp\u003eYou are given a sequence consisting of $$$N$$$ integers $$$\\lbrace a_i \\rbrace$$$. There will be $$$m$$$ different events.\u003c/p\u003e\u003cul\u003e\u003cp\u003e \u003c/p\u003e\u003cli\u003e $$$\\texttt{AND} ~ l ~ r ~ v$$$ – for all elements $$$a_i ~ (l \\leq i \\leq r)$$$, change $$$a_i$$$ to $$$a_i ~ \\\u0026amp; ~ v$$$, where $$$\\\u0026amp;$$$ means bitwise AND\u003cp\u003e \u003c/p\u003e\u003c/li\u003e\u003cli\u003e $$$\\texttt{UPD} ~ x ~ v$$$ – change $$$a_x$$$ to $$$v$$$\u003cp\u003e \u003c/p\u003e\u003c/li\u003e\u003cli\u003e $$$\\texttt{QUE} ~ l ~ r$$$ – ask for the maximum value of $$$a_i$$$ where $$$l \\leq i \\leq r$$$\u003c/li\u003e\u003c/ul\u003e\u003cp\u003ePlease write a program to support these events efficiently.\u003c/p\u003e"}},{"title":"Input","value":{"format":"HTML","content":"\u003cp\u003eThe first line contains two integers $$$N, M ~ (1 \\leq N, M \\leq 400\\,000)$$$ denoting the length of sequence and the number of events.\u003c/p\u003e\u003cp\u003eThe second line contains $$$N$$$ integers $$$a_1, a_2, \\cdots, a_n ~ (1 \\leq a_i \\leq 2^{30}-1)$$$ denoting the initial elements of the sequence.\u003c/p\u003e\u003cp\u003eFor the next $$$M$$$ lines, each line describes an event. It is guaranteed that $$$1 \\leq l, r, x \\leq n$$$ and $$$1 \\leq v \\leq 2^{30}-1$$$.\u003c/p\u003e"}},{"title":"Output","value":{"format":"HTML","content":"\u003cp\u003eFor each $$$\\texttt{QUE}$$$ event, print a single line containing an integer, denoting the answer.\u003c/p\u003e\u003cp\u003eIt is guaranteed that there is at least one $$$\\texttt{QUE}$$$ event.\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\u003e5 11\n6 3 5 2 3\nAND 2 4 10\nUPD 1 8\nAND 3 4 7\nUPD 1 6\nQUE 1 4\nAND 3 5 10\nAND 3 5 2\nUPD 5 1\nQUE 2 5\nUPD 3 6\nQUE 1 5\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e6\n2\n6\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"HTML","content":"\u003cp\u003eSince the input file is large, please use \u0027fread\u0027 (strongly recommended) or \u0027scanf\u0027 instead of \u0027cin\u0027.\u003c/p\u003e"}}]}