#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 400005;
int s;
int n;
string a;
int m;
string b[N];
int z;
int t[N][26];
int q[N];
int ans[N];
int f[N];
void solvv() {
  z = 0;
  memset(t, 0, sizeof t);
  memset(q, 0, sizeof q);
  memset(ans, 0, sizeof ans);
  for (int i = 0; i < m; ++i) {
    int n = b[i].size();
    if (n <= s) {
      int pos = 0;
      for (int j = 0; j < n; ++j) {
        if (!t[pos][b[i][j] - 'a']) t[pos][b[i][j] - 'a'] = ++z;
        pos = t[pos][b[i][j] - 'a'];
      }
      ++q[pos];
    } else {
      string u = b[i] + a;
      n += ::n;
      int k = 0, r = 0;
      memset(f, 0, sizeof f);
      for (int j = 1; j < n; ++j) {
        if (j <= r) f[j] = min(r - j + 1, f[j - k]);
        while (j + f[j] < n && u[f[j]] == u[j + f[j]]) ++f[j];
        if (j + f[j] - 1 > r) {
          r = j + f[j] - 1;
          k = j;
        }
      }
      n -= ::n;
      for (int j = n; j < n + ::n; ++j) {
        if (f[j] >= n) {
          ans[j - n]++;
        }
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    int pos = 0;
    for (int j = 0; j < n - i; ++j) {
      if (!t[pos][a[i + j] - 'a']) break;
      pos = t[pos][a[i + j] - 'a'];
      ans[i] += q[pos];
    }
  }
}
int ans1[N], ans2[N];
void solv() {
  cin >> a;
  n = a.size();
  cin >> m;
  for (int i = 0; i < m; ++i) {
    cin >> b[i];
    s += b[i].size();
  }
  s = sqrt(s);
  solvv();
  for (int i = 0; i < n; ++i) ans1[i] = ans[i];
  reverse((a).begin(), (a).end());
  for (int i = 0; i < m; ++i) reverse((b[i]).begin(), (b[i]).end());
  solvv();
  for (int i = 0; i < n; ++i) ans2[i] = ans[i];
  reverse(ans2, ans2 + n);
  long long yans = 0;
  for (int i = 1; i < n; ++i) {
    yans += ans1[i] * 1LL * ans2[i - 1];
  }
  printf("%lld\n", yans);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  solv();
  return 0;
}

### Prompt

Construct a CPP code solution to the problem outlined:

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 ∑_{i=1}^{n} ∑_{j=1}^{n} f(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

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 ∑_{i=1}^{n} |s_i| ≤ 2 ⋅ 10^5. All strings consist of lowercase English letters.

Output

Print one integer — the value of ∑_{i=1}^{n} ∑_{j=1}^{n} f(t, s_i + s_j).

Examples

Input


aaabacaa
2
a
aa


Output


5


Input


aaabacaa
4
a
a
a
b


Output


33

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
mt19937 rnf(2106);
const int N = 400005;
int s;
int n;
string a;
int m;
string b[N];
int z;
int t[N][26];
int q[N];
int ans[N];
int f[N];
void solvv() {
  z = 0;
  memset(t, 0, sizeof t);
  memset(q, 0, sizeof q);
  memset(ans, 0, sizeof ans);
  for (int i = 0; i < m; ++i) {
    int n = b[i].size();
    if (n <= s) {
      int pos = 0;
      for (int j = 0; j < n; ++j) {
        if (!t[pos][b[i][j] - 'a']) t[pos][b[i][j] - 'a'] = ++z;
        pos = t[pos][b[i][j] - 'a'];
      }
      ++q[pos];
    } else {
      string u = b[i] + a;
      n += ::n;
      int k = 0, r = 0;
      memset(f, 0, sizeof f);
      for (int j = 1; j < n; ++j) {
        if (j <= r) f[j] = min(r - j + 1, f[j - k]);
        while (j + f[j] < n && u[f[j]] == u[j + f[j]]) ++f[j];
        if (j + f[j] - 1 > r) {
          r = j + f[j] - 1;
          k = j;
        }
      }
      n -= ::n;
      for (int j = n; j < n + ::n; ++j) {
        if (f[j] >= n) {
          ans[j - n]++;
        }
      }
    }
  }
  for (int i = 0; i < n; ++i) {
    int pos = 0;
    for (int j = 0; j < n - i; ++j) {
      if (!t[pos][a[i + j] - 'a']) break;
      pos = t[pos][a[i + j] - 'a'];
      ans[i] += q[pos];
    }
  }
}
int ans1[N], ans2[N];
void solv() {
  cin >> a;
  n = a.size();
  cin >> m;
  for (int i = 0; i < m; ++i) {
    cin >> b[i];
    s += b[i].size();
  }
  s = sqrt(s);
  solvv();
  for (int i = 0; i < n; ++i) ans1[i] = ans[i];
  reverse((a).begin(), (a).end());
  for (int i = 0; i < m; ++i) reverse((b[i]).begin(), (b[i]).end());
  solvv();
  for (int i = 0; i < n; ++i) ans2[i] = ans[i];
  reverse(ans2, ans2 + n);
  long long yans = 0;
  for (int i = 1; i < n; ++i) {
    yans += ans1[i] * 1LL * ans2[i - 1];
  }
  printf("%lld\n", yans);
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  solv();
  return 0;
}

```