#include <iostream>
#include <vector>
#include <string>
#include <set>
#include <queue>

using namespace std;

int main()
{
	int n, m;
	cin >> n >> m;

	vector<string> cimkek(n);

	for (int i = 0; i < n; i++)
	{
		cin >> cimkek[i];
	}
	int index=0;
	set<int> been;
	vector<int> count;
	while (index != n and been.size() != n)
	{
		if (!been.count(index))
		{
			int temp1=1;
			for (int shift = 0; shift < m; shift++)
			{
				string current = cimkek[index];
				for (int i = 0; i < m; i++) {
					int newIndex = (i - shift + m) % m;
					current[newIndex] = cimkek[index][i];
				}
				for (int str = index+1; str < n; str++)
				{
					if (!been.count(str) and cimkek[str] == current)
					{
						been.insert(str);
						temp1++;
					}
				}
			}
			if (temp1>1)
			{
				count.push_back(temp1);
			}
			temp1 = 1;
		}
		index++;
	}

	int out = 0;

	for (int i = 0; i < count.size(); i++)
	{
		out += (count[i] * (count[i] - 1)) / 2;
	}
	cout << out;
}