#include <bits/stdc++.h>
using namespace std;
using ll = long long;

const int MOD = 1e9 + 7;


struct Node {
    int to[27];
    int cnt;

    Node() {
        for(int i = 0; i < 27; i++) {
            to[i] = -1;
        }
        cnt = 0;
    }
};

vector<Node> trie(1, Node());


string minimalRotation(const string &s) {
    int N = (int)s.size();
    int minPos = 0, l = 0, p = 1;
    while (p < N && minPos + l + 1 < N) {
        if (s[minPos + l] == s[(p + l) % N]) {
            l++;
        } else if (s[minPos + l] < s[(p + l) % N]) {
            p = p + l + 1;
            l = 0;
        } else {
            minPos = max(minPos + l + 1, p);
            p = minPos + 1;
            l = 0;
        }
    }
    
    string ans;
    for (int i = minPos; (int)ans.size() != N; i = (i + 1) % N) {
        ans.push_back(s[i]);
    }
    return ans;
}

void add(string s)
{
    int curr = 0;
    for(char c : s) {
        if(trie[curr].to[c - 'a'] == -1 ) {
            trie[curr].to[c - 'a'] = trie.size();
            trie.push_back(Node());
        }
        curr = trie[curr].to[c - 'a'];
        trie[curr].cnt++;
    }
}

int query(string s) {
    int curr = 0;
    for(char c : s) {
        if(trie[curr].to[c - 'a'] == -1) return 0;

        curr = trie[curr].to[c - 'a'];
    }

    return trie[curr].cnt;
} 


int main() {
    int n,m;
    cin >> n >> m;
    ll mo = 0;
    for(int i = 0; i < n; i++) {
        string s;
        cin >> s;

        s = minimalRotation(s);
        mo += query(s);
        add(s);
    }
    cout << mo;

    return 0;
}