#include <bits/stdc++.h>
using namespace std;
long long mod = 1000000000 + 7;
long long power(long long x, long long y) {
  long long res = 1;
  x = x;
  while (y > 0) {
    if (y & 1) res = (res * x);
    y = y >> 1;
    x = (x * x);
  }
  return res;
}
long long powe(long long x, long long y) {
  x = x % mod, y = y % (mod - 1);
  long long ans = 1;
  while (y > 0) {
    if (y & 1) {
      ans = (1ll * x * ans) % mod;
    }
    y >>= 1;
    x = (1ll * x * x) % mod;
  }
  return ans;
}
void fun() {}
const long long N = 1e9 + 7;
bool isPrime(long long n) {
  for (long long i = 2; i * i <= n; i++)
    if (n % i == 0) return false;
  return true;
}
long long ncr(long long n, long long r) {
  long long res = 1;
  if (r > n) return 0;
  if (r > n - r) r = n - r;
  for (long long i = 0; i < r; i++) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  fun();
  long long tt = 1;
  while (tt--) {
    long long n, k;
    cin >> n >> k;
    char a[n][k];
    for (long long i = 0; i < n; i++) {
      for (long long j = 0; j < k; j++) {
        cin >> a[i][j];
      }
    }
    long long ans = 1;
    for (long long i = 0; i < k; i++) {
      set<long long> s;
      for (long long j = 0; j < n; j++) {
        s.insert(a[j][i] - 'a');
      }
      ans = (((ans) % mod) * (s.size()) % mod) % mod;
    }
    cout << ans % mod;
  }
  return 0;
}
