{"trustable":true,"sections":[{"title":"Description","value":{"format":"MD","content":"Given two strings, find the number of ways to choose a substring from each string such that the two substrings are the same. Two ways are considered different if there is at least one position where the two substrings differ."}},{"title":"Input","value":{"format":"MD","content":"Two lines, two strings $s_1,s_2$, with lengths $n_1,n_2$."}},{"title":"Output","value":{"format":"MD","content":"Output an integer representing the answer."}},{"title":"Sample 1","value":{"format":"MD","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\u003eaabb\nbbaa\u003c/pre\u003e\u003c/td\u003e\n \u003ctd\u003e\u003cpre\u003e10\u003c/pre\u003e\u003c/td\u003e\n \u003c/tr\u003e\n\u003c/tbody\u003e\n\u003c/table\u003e"}},{"title":"Hint","value":{"format":"MD","content":"$1\\le n_1,n_2\\le 2\\times 10^5$, and the strings only contain lowercase letters."}}]}