#include <bits/stdc++.h>
#define ll long long

using namespace std;
const int N = 4e5+5, B = 200; 
int n, m; 
string a[N], b[N]; 

int f[N], r[N]; 
int gmax (string s) {
    int res = 1; 
    r[0] = 1; 
    for (int i = 1, j = 0, mr = 0;i < s.size();i++) {
        r[i] = 0; 
        if (mr >= i) r[i] = min(r[j+j-i], mr-i+1); 
        while (i-r[i] >= 0 && i+r[i] < s.size() && s[i-r[i]] == s[i+r[i]]) r[i]++; 
        if (i+r[i]-1 > mr) mr = i+r[i]-1, j = i; 
        res = max(res, r[i]); 
    }
    return res; 
}

int main () {
    cin >> n >> m; 
    for (int i = 1;i <= n;i++) cin >> a[i]; 
    for (int i = 1;i <= m;i++) cin >> b[i]; 
    ll ans = 0; 
    for (int i = 1;i <= n;i++) for (int j = 1;j <= m;j++) ans += gmax(a[i]+b[j]); 
    cout << ans; 
    return 0; 
}