{"trustable":true,"sections":[{"title":"","value":{"format":"MD","content":"A string is a finite sequence of symbols that are chosen from an alphabet. In this problem, you are given two non-empty strings **A** and **B**, both contain lower case English alphabets. You have to find the number of times **B** occurs as a substring of **A**."}},{"title":"Input","value":{"format":"MD","content":"Input starts with an integer **T (\u0026#8804; 5)**, denoting the number of test cases.\n\nEach case starts with two lines. First line contains **A** and second line contains **B**. You can assume than **1 \u0026#8804; length(A),length(B) \u0026#8804; 10\u003csup\u003e6\u003c/sup\u003e**."}},{"title":"Output","value":{"format":"MD","content":"For each case, print the case number and the number of times **B** occurs as a substring of **B**."}},{"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\u003e4\naxbyczd\nabc\nabcabcabcabc\nabc\naabacbaabbaaz\naab\naaaaaa\naa\n\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003eCase 1: 0\nCase 2: 4\nCase 3: 2\nCase 4: 5\n\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e\n"}},{"title":"Note","value":{"format":"MD","content":"Dataset is huge, use faster I/O methods."}}]}