#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
long long binom[1001][1001];
long long bell[1001];
int main() {
  binom[0][0] = 1;
  bell[0] = 1;
  for (int i = 1; i <= 1000; i++) {
    binom[i][0] = 1;
    for (int j = 1; j <= 1000; j++) {
      binom[i][j] = binom[i - 1][j - 1] + binom[i - 1][j];
      if (binom[i][j] >= MOD) binom[i][j] -= MOD;
      bell[i] += binom[i - 1][j - 1] * bell[j - 1] % MOD;
      if (bell[i] >= MOD) bell[i] -= MOD;
    }
  }
  int n, m;
  cin >> m >> n;
  long long masks[m];
  memset(masks, 0, sizeof masks);
  for (int i = 0; i < n; i++) {
    string str;
    cin >> str;
    for (int j = 0; j < m; j++)
      if (str[j] == '1') masks[j] |= 1LL << i;
  }
  sort(masks, masks + m);
  int cur = 1;
  long long ans = 1;
  for (int i = 1; i < m; i++)
    if (masks[i] == masks[i - 1])
      cur++;
    else {
      ans = ans * bell[cur] % MOD;
      cur = 1;
    }
  ans = ans * bell[cur] % MOD;
  cout << ans << endl;
}
