#include <bits/stdc++.h>
using ll = long long;
using ld = long double;
using namespace std;
const int MOD = 1000 * 1000 * 1000 + 7;
ll pw(ll a, ll b = MOD - 2) {
  if (b == 0) {
    return 1;
  }
  ll v = pw(a, b / 2);
  v = (v * v) % MOD;
  if (b & 1) {
    v = (v * a) % MOD;
  }
  return v;
}
constexpr int MAXN = 1001;
ll f[MAXN];
ll a[MAXN];
ll cnk[MAXN][MAXN];
int main() {
  ios_base::sync_with_stdio(false);
  cout.setf(ios::fixed);
  cout.precision(20);
  cout.tie(nullptr);
  cin.tie(nullptr);
  int m, n;
  cin >> m >> n;
  cnk[0][0] = 1;
  for (int i = 1; i <= m; ++i) {
    cnk[i][0] = 1;
    for (int j = 1; j <= i; ++j) {
      cnk[i][j] = (cnk[i - 1][j] + cnk[i - 1][j - 1]) % MOD;
    }
  }
  f[0] = 1;
  for (int i = 1; i <= m; ++i) {
    for (int j = 0; j < i; ++j) {
      f[i] = (f[i] + cnk[i - 1][j] * f[i - j - 1]) % MOD;
    }
  }
  for (int i = 0; i < n; ++i) {
    ll val = (1ll << i);
    string s;
    cin >> s;
    for (int j = 0; j < m; ++j) {
      a[j] += (s[j] - '1') * val;
    }
  }
  ll ans = 1;
  sort(a, a + m);
  for (int l = 0, r = 0; l < m; l = r) {
    while (r < m && a[l] == a[r]) {
      ++r;
    }
    ans = (ans * f[r - l]) % MOD;
  }
  cout << ans << "\n";
}
