#include <bits/stdc++.h>
const int MAXN = 50 + 10, MAXM = 1000 + 10;
const int MOD = 1e9 + 7;
namespace solver1 {
long long mask[MAXM];
int choose[MAXM][MAXM], f[MAXM];
void main() {
  int n, m;
  scanf("%d%d", &m, &n);
  for (int i = 0; i < n; i++) {
    char buff[MAXM];
    scanf("%s", buff + 1);
    for (int j = 1; j <= m; j++) {
      mask[j] |= (1ll * (buff[j] - '0')) << i;
    }
  }
  std::sort(mask + 1, mask + m + 1);
  choose[0][0] = 1;
  for (int i = 1; i <= m; i++) {
    choose[i][0] = 1;
    for (int j = 1; j <= i; j++) {
      choose[i][j] = choose[i - 1][j] + choose[i - 1][j - 1];
      choose[i][j] %= MOD;
    }
  }
  f[0] = 1;
  for (int i = 1; i <= m; i++) {
    f[i] = 1;
    for (int j = 1; j < i; j++) {
      f[i] += 1ll * f[j] * choose[i - 1][j] % MOD;
      f[i] %= MOD;
    }
  }
  int cnt = 1, ans = 1;
  for (int i = 2; i <= m; i++) {
    if (mask[i] == mask[i - 1]) {
      cnt++;
    } else {
      ans = 1ll * ans * f[cnt] % MOD;
      cnt = 1;
    }
  }
  ans = 1ll * ans * f[cnt] % MOD;
  printf("%d", ans);
}
}  // namespace solver1
int main() { solver1::main(); }
