#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;

const int B = 777;
const int N = 200'447;
const int D = 1 << 16;
const int mod = 1'000'000'007;

void updAdd(int& a, int b)
{
	a += b;
	if (a >= mod)
		a -= mod;
}

int dps[D];
int dp[N];

int main()
{
	ios::sync_with_stdio(0); 
	cin.tie(0);
	cout << fixed << setprecision(15);
	
	int n, d;
	cin >> n >> d;
	
	VI v(n);
	FOR (i, 0, n)
	{
		string s;
		cin >> s;
		FOR (j, 0, d)
		{
			if (s[j] == '1')
				v[i] += 1 << j;
		}
	}
	FOR (i, 0, 1 << d)
		dps[i] = 1;
	int L = 0;
	int ans = 0;
	while (L < n)
	{
		int R = min(L + B, n);
		FOR (i, L, R)
		{
			FOR (j, L, i)
			{
				if (v[j] == (v[j] & v[i]))
					updAdd(dp[i], dp[j]);
			}
			updAdd(dp[i], dps[v[i]]);
			updAdd(ans, dp[i]);
		}
		VI a(1 << d);
		FOR (i, L, R)
			updAdd(a[v[i]], dp[i]);
		FOR (i, 0, d)
		{
			FOR (j, 0, 1 << d)
			{
				if (j & (1 << i))
					updAdd(a[j], a[j ^ (1 << i)]);
			}
		}
		FOR (i, 0, 1 << d)
			updAdd(dps[i], a[i]);
		L += B;
	}
	cout << ans << '\n';
	
	
	return 0;
}