// Slower C++ solution:
#include <bits/stdc++.h>

#define SZ(x) ((int)x.size())

#define ALL(x) (x).begin(), (x).end()

using namespace std;

typedef long long ll;

typedef long double ld;

int n, m;

int a[15], used[15], res;

char s[15][15];

void f(int cur) {

	if(cur == n + 1) {

		bool usedMiddle = 0;

		for(int i=1; i<=m; i++) used[i] = 0;

		for(int i=1; i<=m; i++) {

			if(used[i]) continue;

			bool found = 0;

			for(int j=i+1; j<=m; j++) {

				if(used[j]) continue;

				bool flag = 1;

				for(int k=1; k<=n; k++)

					if(s[k][i] != s[a[k]][j] || s[a[k]][i] != s[k][j])

						{ flag = 0; break; }

				if(flag) {

					used[i] = used[j] = 1;

					found = 1;

					break;

				}

			}

			if(!found) {

				if(m % 2 == 0) return;

				if(usedMiddle) return;

				bool flag = 1;

				for(int k=1; k<=n; k++)

					if(s[k][i] != s[a[k]][i])

						{ flag = 0; break; }

				if(!flag) return;

				used[i] = 1;

				usedMiddle = 1;

			}

		}

		res = 1;

		return;

	}

	if(a[cur] != 0) {

		f(cur + 1);

		return;

	}

	for(int i=cur+1; i<=n; i++) {

		if(a[i] != 0) continue;

		a[cur] = i;

		a[i] = cur;

		f(cur + 1);

		a[cur] = a[i] = 0;

	}

}

int main() {

	scanf("%d%d", &n, &m);

	for(int i=1; i<=n; i++)

		scanf("%s", &s[i][1]);

	if(n & 1) {

		for(int i=1; i<=n; i++) {

			a[i] = i;

			f(1);

			a[i] = 0;

		}

	} else f(1);

	puts(res ? "YES" : "NO");

	return 0;

}

// Faster C++ solution for the same problem (measured speedup: 1.466175024168878x):
#include <cstdio>

 

char c[15][15],d[15],e[15];

int i,m,n;

 

inline bool dfs2(int x)

{

    if (x>m)

        return true;

    if (e[x])

        return dfs2(x+1);

    else

    {

        int t=0,r=0;

        for (int i=x;i<=m;i++)

            if (! e[i])

                t++;

        for (int i=x;i<=m;i++)

            if (! e[i])

            {

                e[x]=i,e[i]=x,r=1;

                for (int j=1;j<=n;j++)

                    if ((c[j][x]!=c[d[j]][i]) || (c[d[j]][x]!=c[j][i]))

                    {

                        r=0;

                        break;

                    }

                if(i==x){

                    if(r&&(t&1)&&dfs2(x+1))return true;

                }

                else{

                    if(r){

                        if(dfs2(x+1))return true;else return false;

                    }

                }

                /*if ((r) && ((t&1) || (i!=x)) && (dfs2(x+1)))

                    return true;

                else if(i!=x)return false;*/

                e[x]=0,e[i]=0;

            }

    }

    return false;

}

 

inline bool dfs1(int x)

{

    if (x>n)

        return dfs2(1);

    if (d[x])

        return dfs1(x+1);

    else

    {

        int t=0;

        for (int i=x;i<=n;i++)

            if (! d[i])

                t++;

        for (int i=x;i<=n;i++)

            if (! d[i])

            {

                d[x]=i,d[i]=x;

                if (((t&1) || (i!=x)) && (dfs1(x+1)))

                    return true;

                d[x]=0,d[i]=0;

            }

    }

    return false;

}



int main()

{

    scanf("%d%d",&n,&m);

    for (i=1;i<=n;i++)

        scanf("%s",c[i]+1);

    if (dfs1(1))

        puts("YES");

    else

        puts("NO");

    return 0;

}