{"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\"\u003eA string $w$ is said to be a Lyndon word if $w$ is lexicographically smaller than any of its cyclic rotations. \u003cbr\u003eThe longest Lyndon substring of a string $s$ is the longest substring of $s$ which is a Lyndon word.\u003cbr\u003eChiaki has $n$ strings $s_1,s_2,\\dots,s_n$. She has some queries: for some pair $(i,j)$, find the length of the longest Lyndon substring of string $s_is_j$.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"There are multiple test cases. The first line of input contains an integer $T$, indicating the number of test cases. For each test case:\u003cbr\u003eThe first line contains two integers $n$ and $m$ $(1 \\le n, m \\le 10^5)$ -- the number of strings and the number of queries.\u003cbr\u003eEach of the next $n$ lines contains a nonempty string $s_i$ $(1 \\le s_i \\le 10^5)$ consisting of lowercase English letters.\u003cbr\u003eEach of the next $m$ lines contains two integers $i$ and $j$ ($1 \\le i, j \\le n$) denoting a query.\u003cbr\u003eIt is guaranteed that in one test case the sum of all $|s|$ does not exceed $5 \\times 10^5$ and that in all cases the sum of all $|s|$ does not exceed $5 \\times 10^6$.\u003cbr\u003eIt is guaranteed that neither the sum of all $n$ nor the sum of all $m$ exceeds $10^6$."}},{"title":"Output","value":{"format":"HTML","content":"For each query, output an integer denoting the answer.\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\n2 1\r\naa\r\nbb\r\n1 2\r\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e4\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}