# include <bits/stdc++.h>
using namespace std;
string mat[1005];
string s;
string t;
int pref[300005];
int can[300005];
int uk = 1;
void prefixes()
{
    int n=t.size();
    int i;
    pref[0]=-1;
    int pos;
    for(i=1;i<n;i++)
    {
         pos=pref[i-1];
        while(1)
        {
            if(t[pos+1]==t[i]){pref[i]=pos+1;break;}
            if(pos==-1){pref[i]=-1;break;}
            pos=pref[pos];
        }
    }
}
void kmp()
{
//8cout<<t<<" "<<s<<endl;
    prefixes();
    int pos1=0,pos2=0,br=0;
    while(pos1<s.size())
    {
        if(pos2==t.size())
        {
          //  br++;
         // cout<<"found"<<" "<<pos1<<" "<<pos2<<" "<<pos1-t.size()<<" "<<uk<<endl;
          if(can[pos1-t.size()]==uk)can[pos1-t.size()]=uk+1;
            pos2=pref[pos2-1]+1;
            continue;
        }
        if(s[pos1]==t[pos2])
        {
            pos1++;
            pos2++;
            continue;
        }

        pos2=pref[pos2-1]+1;
        if(pos2==0)pos1++;
    }
    uk++;
    //cout<<br<<endl;
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
  freopen ("rolling_table.in","r",stdin);  freopen ("rolling_table.out","w",stdout);
int i,j;
int n,m;
cin>>n>>m;
if(n<=m){
for(i=1;i<=n;i++)
    cin>>mat[i];
}
else
{
    for(j=1;j<=m;j++)
        mat[j]="";
    for(i=1;i<=n;i++)
    {
        cin>>s;
        for(j=1;j<=m;j++)
            mat[j]+=s[m-j];
    }
    swap(m,n);
}

    int br = 0;
for(i=0;i<n;i++)
{
   // cout<<mat[i]<<endl;
  //  cout<<i<<"::"<<endl;
memset(can,0,sizeof(can));
uk=0;
    for(j=1;j<=n;j++)
    {
        t  = mat[j];
        s = mat[(i+j)%n+1]+mat[(i+j)%n+1];
        kmp();
    }

       for(j=0;j<m;j++)
       {
         //  cout<<j<<" "<<can[j]<<endl;
           if(can[j]==uk)br++;
       }

//cout<<i<<" "<<br<<endl;
}
cout<<br<<endl;
return 0;
}