{"trustable":false,"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":"给定一个区间中,将区间的每一个数看成一个字符串,求这个区间内每个字符串的最大上升子序列等于k的个数。"}},{"title":"Input","value":{"format":"HTML","content":"First a integer T(T\u0026lt;\u003d10000),then T lines follow, every line has three positive integer L,R,K.(\n\u003cbr\u003e0\u0026lt;L\u0026lt;\u003dR\u0026lt;2\u003csup\u003e63\u003c/sup\u003e-1 and 1\u0026lt;\u003dK\u0026lt;\u003d10)."}},{"title":"Output","value":{"format":"HTML","content":"For each query, print \"Case #t: ans\" in a line, in which t is the number of the test case starting from 1 and ans is the answer."}},{"title":"Sample Input","value":{"format":"HTML","content":"\u003cpre\u003e1\n123 321 2\u003c/pre\u003e"}},{"title":"Sample Output","value":{"format":"HTML","content":"\u003cpre\u003eCase #1: 139 \u003c/pre\u003e"}}]}