write a go solution for Description:
You are given a string t and n strings s_1,s_2,...,s_n. All strings consist of lowercase Latin letters.

Let f(t,s) be the number of occurences of string s in string t. For example, f('aaabacaa','aa')=3, and f('ababa','aba')=2.

Calculate the value of sumlimits_i=1^nsumlimits_j=1^nf(t,s_i+s_j), where s+t is the concatenation of strings s and t. Note that if there are two pairs i_1, j_1 and i_2, j_2 such that s_i_1+s_j_1=s_i_2+s_j_2, you should include both f(t,s_i_1+s_j_1) and f(t,s_i_2+s_j_2) in answer.

Input Format:
The first line contains string t (1<=|t|<=2*10^5).

The second line contains integer n (1<=n<=2*10^5).

Each of next n lines contains string s_i (1<=|s_i|<=2*10^5).

It is guaranteed that sumlimits_i=1^n|s_i|<=2*10^5. All strings consist of lowercase English letters.

Output Format:
Print one integer — the value of sumlimits_i=1^nsumlimits_j=1^nf(t,s_i+s_j).

Note:
None. Output only the code with no comments, explanation, or additional text.