#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define X first
#define Y second
#define ALL(v) v.begin(), v.end()
#define SZ(a) ((int)a.size())
#define pb push_back

const int MAXN = 2e6 + 5;
int z[MAXN];

void Manacher(vector<string> tmp) {
    vector<string> s;
    s.pb("");
    int l = 0, r = 0;
    for (auto &c : tmp) s.pb(c), s.pb("");
    for (int i = 0; i < SZ(s); i++) {
        z[i] = r > i ? min(z[2 * l - i], r - i) : 1;
        while (i - z[i] >= 0 && i + z[i] < SZ(s)
            && s[i + z[i]] == s[i - z[i]]) ++z[i];
        if (z[i] + i > r) r = z[i] + i, l = i;
    }
}

vector<string> v, vr;

int pre[MAXN];

int main() {
    ios::sync_with_stdio(0), cin.tie(0);
    int n, m;
    cin >> n >> m;

    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        v.pb(s);
    }
    vr.resize(m, string(n, ' '));
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            vr[j][i] = v[i][j];

    Manacher(v);
    ll s1 = 0;
    {
        for (int i = 0; i <= n; i++)
            pre[i] = 0;
        int l = 0;
        pre[0] = 1;
        for (int i = 1; i < n; i++) {
            int ra = z[(i - 1) * 2 + 2] / 2;     
            if (i - l <= ra)
                pre[i] = 1, l = i;
            pre[i] += pre[i - 1];
        }
        int r = n - 1;
        s1 += pre[n - 1];
        for (int i = n - 2; i >= 0; i--) {
            int ra = z[i * 2 + 2] / 2; 
            if (r - i <= ra)
                r = i, s1 += pre[i];
        }
    }
    Manacher(vr);
    ll s2 = 0;
    {
        for (int i = 0; i <= m; i++)
            pre[i] = 0;
        int l = 0;
        pre[0] = 1;
        for (int i = 1; i < m; i++) {
            int ra = z[(i - 1) * 2 + 2] / 2;     
            if (i - l <= ra)
                pre[i] = 1, l = i;
            pre[i] += pre[i - 1];
        }
        int r = m - 1;
        s2 += pre[m - 1];
        for (int i = m - 2; i >= 0; i--) {
            int ra = z[i * 2 + 2] / 2; 
            if (r - i <= ra)
                r = i, s2 += pre[i];
        }
    }
    
    cout << s1 * s2 << endl;

}