#include <bits/stdc++.h>
using namespace std;
const int maxm = 1000, maxn = 50, mod = 1e9 + 7;
inline int Add(int x) { return x >= mod ? x - mod : x; }
inline void Add(int &x, int y) {
  x += y;
  if (x >= mod) x -= mod;
}
inline int Mul(int x, int y) { return (long long)x * y % mod; }
int n, m, bio[maxm + 1][maxm + 1], dp[maxm + 1];
char s[maxn][maxm + 1];
map<unsigned long long, int> size;
int main(void) {
  scanf("%d%d", &m, &n);
  for (int i = 0; i < n; ++i) {
    scanf("%s", s[i]);
  }
  for (int i = 0; i <= m; ++i) {
    bio[i][0] = bio[i][i] = 1;
    for (int j = 1; j < i; ++j) {
      bio[i][j] = Add(bio[i - 1][j - 1] + bio[i - 1][j]);
    }
  }
  dp[0] = dp[1] = 1;
  for (int i = 2; i <= m; ++i) {
    dp[i] = 0;
    for (int j = 1; j <= i; ++j) {
      Add(dp[i], Mul(bio[i - 1][j - 1], dp[i - j]));
    }
  }
  for (int i = 0; i < m; ++i) {
    unsigned long long b = 0;
    for (int j = 0; j < n; ++j) {
      b |= (long long)(s[j][i] - '0') << j;
    }
    ++size[b];
  }
  int ans = 1;
  for (auto x : size) {
    ans = Mul(ans, dp[x.second]);
  }
  printf("%d\n", ans);
  return 0;
}
