#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ull unsigned long long
const int N=4e5+5;
int n,m,l1[N],l2[N],zd1[N],zd2[N],res;
vector<int>q1[N],q2[N],mk1[N],mk2[N];
vector<ull>qh1[N],qh2[N],hh1[N],hh2[N];
ull pw[N];
ull h1(vector<ull>&h,int l,int r){
	return h[r]-h[l-1]*pw[r-l+1];
}
ull h2(vector<ull>&h,int l,int r){
	return h[l]-h[r+1]*pw[r-l+1];
}
int glh(vector<ull>&qh,vector<ull>&hh,int n){
	int res=0;
	for(int i=1;i<=n;i++){
		int l=1,r=min(i,n-i+1);
		while(l<r){
			int mid=l+r+1>>1;
			if(h1(qh,i-mid+1,i+mid-1)==h2(hh,i-mid+1,i+mid-1))l=mid;
			else r=mid-1;
		}
		res=max(res,2*l-1);
	}
	return res;
}
int gets(vector<int>&q1,vector<int>&q2,int k){
	int nw=q2.size()-1,res=0;
	while(k>0&&nw>0&&q1[k]==q2[nw])k--,nw--,res++;
	return res;
}
int solve(int a,int b){
	int res=max(zd1[a],zd2[b]);
	for(int i=1;i<=l1[a];i++){
		if(!mk1[a][i])continue;
		res=max(res,l1[a]-i+1+gets(q1[a],q2[b],i-1)*2);
	}
	for(int i=1;i<=l2[b];i++){
		if(!mk2[b][i])continue;
		res=max(res,l2[b]-i+1+gets(q2[b],q1[a],i-1)*2);
	}
//	if(a<=2)cout<<a<<" "<<b<<" "<<res<<" "<<zd1[a]<<endl;
	return res;
}
signed main(){
//	freopen("mirror1.in","r",stdin);
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n>>m;
	pw[0]=1;
	for(int i=1;i<N;i++)pw[i]=pw[i-1]*131;
	for(int i=1;i<=n;i++){
		string s;
		cin>>s;
		l1[i]=s.size();
		q1[i].push_back(0);
		for(auto c:s)q1[i].push_back(c-'a');
		qh1[i].resize(q1[i].size());
		hh1[i].resize(q1[i].size());
		mk1[i].resize(q1[i].size());
		for(int j=1;j<=l1[i];j++)qh1[i][j]=qh1[i][j-1]*131+q1[i][j]+1;
		for(int j=l1[i];j>=1;j--)hh1[i][j]=hh1[i][j+1]*131+q1[i][j]+1;
	    for(int j=1;j<=l1[i];j++)if(l1[i]-j+1&1)mk1[i][j]=h1(qh1[i],j,l1[i])==h2(hh1[i],j,l1[i]);
	    zd1[i]=glh(qh1[i],hh1[i],l1[i]);
	}
	for(int i=1;i<=m;i++){
		string s;
		cin>>s;
		l2[i]=s.size();
		q2[i].push_back(0);
		for(auto c:s)q2[i].push_back(c-'a');
		reverse(q2[i].begin()+1,q2[i].end());
		qh2[i].resize(q2[i].size());
		hh2[i].resize(q2[i].size());
		mk2[i].resize(q2[i].size());
		for(int j=1;j<=l2[i];j++)qh2[i][j]=qh2[i][j-1]*131+q2[i][j]+1;
		for(int j=l2[i];j>=1;j--)hh2[i][j]=hh2[i][j+1]*131+q2[i][j]+1;
	    for(int j=1;j<=l2[i];j++)if(l2[i]-j+1&1)mk2[i][j]=h1(qh2[i],j,l2[i])==h2(hh2[i],j,l2[i]);
	    zd2[i]=glh(qh2[i],hh2[i],l2[i]);
	}
	for(int i=1;i<=n;i++)for(int j=1;j<=m;j++)res+=solve(i,j);
	cout<<(res+n*m)/2;
}