#include <bits/stdc++.h>
using namespace std;
long long ans, c[1002][1002], f[1002];
int nu[1002], m, n, a[52][1002], b[1002][1002];
bool comp(int _, int __) {
  for (int i = 1; i <= m; ++i)
    if (b[_][i] != b[__][i]) return b[_][i] < b[__][i];
  return 0;
}
bool equ(int _, int __) {
  for (int i = 1; i <= m; ++i)
    if (b[_][i] != b[__][i]) return 0;
  return 1;
}
int main() {
  scanf("%d%d\n", &m, &n);
  for (int i = 1; i <= n; ++i) {
    for (int j = 1; j <= m; ++j) scanf("%1d", &a[i][j]);
  }
  for (int j = 1; j <= m; ++j) {
    for (int i = 1; i <= m; ++i) b[j][i] = 1;
    for (int i = 1; i <= n; ++i) {
      if (a[i][j])
        for (int k = 1; k <= m; ++k) b[j][k] &= a[i][k];
      else
        for (int k = 1; k <= m; ++k) b[j][k] &= (1 - a[i][k]);
    }
  }
  for (int i = 1; i <= m; ++i) nu[i] = i;
  sort(nu + 1, nu + m + 1, comp);
  c[0][0] = 1;
  for (int i = 1; i <= m; ++i)
    for (int j = 0; j <= i; ++j)
      c[i][j] = j ? (c[i - 1][j - 1] + c[i - 1][j]) % ((int)1e9 + 7) : 1;
  f[0] = f[1] = 1;
  for (int i = 2; i <= m; ++i)
    for (int j = 0; j < i; ++j)
      f[i] = (f[i] + c[i - 1][j] * f[j] % ((int)1e9 + 7)) % ((int)1e9 + 7);
  ans = 1;
  for (int i = 1; i <= m;) {
    int t = i;
    while (i < m && equ(nu[i], nu[i + 1])) i++;
    ans = (ans * f[i - t + 1]) % ((int)1e9 + 7);
    i++;
  }
  printf("%I64d", ans);
  return 0;
}
