{"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\"\u003eMario is world-famous plumber. His “burly” figure and amazing jumping ability reminded in our memory. Now the poor princess is in trouble again and Mario needs to save his lover. We regard the road to the boss’s castle as a line (the length is n), on every integer point i there is a brick on height hi. Now the question is how many bricks in [L, R] Mario can hit if the maximal height he can jump is H.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line follows an integer T, the number of test data.\u003cbr\u003eFor each test data:\u003cbr\u003eThe first line contains two integers n, m (1 \u0026lt;\u003d n \u0026lt;\u003d10^5, 1 \u0026lt;\u003d m \u0026lt;\u003d 10^5), n is the length of the road, m is the number of queries.\u003cbr\u003eNext line contains n integers, the height of each brick, the range is [0, 1000000000].\u003cbr\u003eNext m lines, each line contains three integers L, R,H.( 0 \u0026lt;\u003d L \u0026lt;\u003d R \u0026lt; n 0 \u0026lt;\u003d H \u0026lt;\u003d 1000000000.)"}},{"title":"Output","value":{"format":"HTML","content":"For each case, output \"Case X: \" (X is the case number starting from 1) followed by m lines, each line contains an integer. The ith integer is the number of bricks Mario can hit for the ith query.\u003cbr\u003e"}},{"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\u003e1\r\n10 10\r\n0 5 2 7 5 4 3 8 7 7 \r\n2 8 6\r\n3 5 0\r\n1 3 1\r\n1 9 4\r\n0 1 0\r\n3 5 5\r\n5 5 1\r\n4 6 3\r\n1 5 7\r\n5 7 3\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1:\r\n4\r\n0\r\n0\r\n3\r\n1\r\n2\r\n0\r\n1\r\n5\r\n1\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}