#include <bits/stdc++.h>
using namespace std;
const int mod = (int)1e9 + 7;
int m, n;
string a[55];
int mult(int a, int b) { return a * (long long)b % mod; }
int sum(int a, int b) {
  int ans = a + b;
  if (ans >= mod) ans -= mod;
  return ans;
}
int dp[1005][1005];
int ss[1005];
int main() {
  srand(123);
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> m >> n;
  for (int i = 0; i < n; i++) cin >> a[i];
  vector<int> dd;
  for (int i = 0; i < m; i++) dd.push_back(i);
  vector<vector<int> > t;
  t.push_back(dd);
  for (int i = 0; i < n; i++) {
    vector<vector<int> > gg;
    for (int j = 0; j < t.size(); j++) {
      vector<int> f[2];
      for (int first : t[j]) f[a[i][first] - '0'].push_back(first);
      if (f[0].size()) gg.push_back(f[0]);
      if (f[1].size()) gg.push_back(f[1]);
    }
    t = gg;
  }
  dp[1][1] = 1;
  for (int i = 1; i < 1005; i++) {
    dp[i][0] = 0;
    for (int j = 1 + (i == 1); j <= i; j++) {
      dp[i][j] = sum(dp[i - 1][j - 1], mult(j, dp[i - 1][j]));
    }
  }
  for (int i = 1; i < 1005; i++) {
    for (int j = 1; j <= i; j++) ss[i] = sum(ss[i], dp[i][j]);
  }
  int ans = 1;
  for (auto first : t) ans = mult(ans, ss[first.size()]);
  cout << ans;
}
