#include <bits/stdc++.h>

int n, m;

bool similar(std::string a, std::string b) {
    const std::string c = a+a;
    std::string str;
    for(int i = 0; i < m; i++) {
        str = std::string(&c[i], &c[i+m]);
        if (str == b)
        {
            return 1;
        }
    }
    return 0;
}

int main() {
    std::ios::sync_with_stdio(false);
    std::cin.tie(0);
    std::string cache;
    std::vector<std::string> ids;
    int count = 0;
    int cachecount = 0;

    std::cin >> n >> m;
    for(int i = 0; i < n; i++) {
        std::cin >> cache; 
        ids.push_back(cache);
    }

    for (int i = 0; i < n; i++) {
        if (ids[i] == "#") {continue;}
        cachecount = 0;

        for (int j = 0; j < n-i-1; j++) {
            if (ids[n-j-1] == "#") {continue;}

            if(similar(ids[i], ids[n-j-1])) {
                cachecount++;
                ids[n-j-1] = "#";
            }
        }
        count = count + (cachecount*(cachecount+1))/2;
    }
    std::cout << count;
}