{"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\"\u003eMr. Frog has two sequences $a_1,a_2,\\cdots ,a_n$ and $b_1,b_2,\\cdots ,b_m$ and a number p. He wants to know the number of positions q such that sequence $b_1,b_2,\\cdots ,b_m$ is exactly the sequence $a_q,a_{q+p},a_{q+2p},\\cdots ,a_{q+(m-1)p}$ where $q + (m - 1)p\\leq n$ and $q\\geq 1$.\u003c/div\u003e"}},{"title":"Input","value":{"format":"HTML","content":"The first line contains only one integer $T\\leq 100$, which indicates the number of test cases.\u003cbr\u003e\u003cbr\u003eEach test case contains three lines.\u003cbr\u003e\u003cbr\u003eThe first line contains three space-separated integers $1\\leq n\\leq 10^6, 1\\leq m\\leq 10^6$ and $1\\leq p\\leq 10^6$.\u003cbr\u003e\u003cbr\u003eThe second line contains n integers $a_1,a_2,\\cdots ,a_n(1 \\leq a_i \\leq 10^9)$.\u003cbr\u003e\u003cbr\u003ethe third line contains m integers $b_1,b_2,\\cdots ,b_m(1 \\leq b_i \\leq 10^9)$."}},{"title":"Output","value":{"format":"HTML","content":"For each test case, output one line “Case #x: y”, where x is the case number (starting from 1) and y is the number of valid q’s."}},{"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\u003e2\r\n6 3 1\r\n1 2 3 1 2 3\r\n1 2 3\r\n6 3 2\r\n1 3 2 2 3 1\r\n1 2 3\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase #1: 2\r\nCase #2: 1\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}}]}