#include <bits/stdc++.h>
using namespace std;
const long long N = 1005, M = 1e9 + 7;
long long n, m, C[N][N], B[N], ans, a[N];
map<long long, long long> mp;
char s[N];
signed main() {
  scanf("%lld%lld", &n, &m);
  for (long long i = 1; i <= m; i++) {
    scanf("%s", s + 1);
    for (long long j = 1; j <= n; j++) {
      long long t = s[j] == '1';
      a[j] |= t << i - 1;
    }
  }
  for (long long i = 1; i <= n; i++) mp[a[i]]++;
  for (long long i = 0; i <= n; i++) C[i][0] = 1;
  for (long long i = 1; i <= n; i++)
    for (long long j = 1; j <= i; j++)
      C[i][j] = (C[i - 1][j] + C[i - 1][j - 1]) % M;
  B[0] = 1;
  for (long long i = 1; i <= n; i++)
    for (long long j = 0; j < i; j++)
      B[i] = (B[i] + C[i - 1][j] * B[j] % M) % M;
  ans = 1;
  for (auto x : mp) (ans *= B[x.second] % M) %= M;
  printf("%lld", ans);
  return 0;
}
