codeforces 908E New Year and Entity Enumeration

E. New Year and Entity Enumeration

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given an integer m.

Let M = 2m - 1.

You are also given a set of n integers denoted as the set T. The integers will be provided in base 2 as n binary strings of length m.

A set of integers S is called "good" if the following hold.

1. If , then .
2. If , then 
3. 
4. All elements of S are less than or equal to M.

Here,  and  refer to the bitwise XOR and bitwise AND operators, respectively.

Count the number of good sets S, modulo 109 + 7.

Input

The first line will contain two integers m and n (1 ≤ m ≤ 1 000, 1 ≤ n ≤ min(2m, 50)).

The next n lines will contain the elements of T. Each line will contain exactly m zeros and ones. Elements of T will be distinct.

Output

Print a single integer, the number of good sets modulo 109 + 7.

Examples

input

Copy

5 3
11010
00101
11000

output

4

input

Copy

30 2
010101010101010010101010101010
110110110110110011011011011011

output

860616440

Note

An example of a valid set S is {00000, 00101, 00010, 00111, 11000, 11010, 11101, 11111}.

题解：这个题我们先爆搜打表，之后我们会发现这个题的所有方案竖着排列所有1的个数和是相等的，然后这题就成了集合划分问题，用bell数搞？？？本人表示一脸懵逼。

反正我不会证明只会bell数，贴个板子。

代码：

#include<cstdio>
#include<map>
#define ll long long
using namespace std;
int c[1005][1005],f[1005],n,m,ans,x;
ll b[1005];
map<ll,int>mp;
int main()
{
    scanf("%d%d",&m,&n);
    for(int i=0;i<n;i++)
        for(int j=1;j<=m;j++)
        {
            scanf("%1d",&x);
            b[j]+=(1ll*x)<<i;
        }
    for(int i=1;i<=m;i++) mp[b[i]]++;
    for(int i=0;i<=m;i++)
    {
        c[i][0]=1;
        for(int j=1;j<=i;j++)
            c[i][j]=(c[i-1][j-1]+c[i-1][j])%1000000007;
    }
    f[0]=ans=1;
    for(int i=1;i<=m;i++)
        for(int j=0;j<i;j++)
            f[i]=(f[i]+1ll*c[i-1][j]*f[j]%1000000007)%1000000007;
    for(map<ll,int>::iterator it=mp.begin();it!=mp.end();it++) ans=1ll*ans*f[it->second]%1000000007;
    printf("%d\n",ans);
}