#include<bits/stdc++.h>
#define Gc() getchar() 
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;using LL=__int128;
const int N=(1<<17)+5,M=43046721+5,K=600+5,mod=998244353,Mod=mod-1;const db eps=1e-6;const int INF=1e9+7;mt19937 rnd(263082);
int n,m,k,f[N],g[N],ff[N],gg[N];lb dp[N];
char s[N];
void FWT(int *A){
	int i,j,h;
	for(i=2;i<=k;i<<=1) {
		for(j=0;j<k;j+=i) {
			for(h=j;h<j+i/2;h++) A[h]+=A[h+i/2];
		}
	}
}
int p[M],Po[N],To[N];
int main(){
	int i,j,h;scanf("%d%d",&n,&m);k=1<<m-1;
	int tot=k-1;
	for(i=1;i<=n;i++){
		scanf("%s",s+1);
		int z=0;for(j=2;j<=m;j++) z=z<<1|(s[j]=='1');
		if(s[1]=='0') g[(k-1)^z]++,gg[(k-1)^z]++;
		else f[z]++,tot&=z,ff[z]++;
		z=0;for(j=2;j<=m;j++) z=z*3+(s[j]=='1'?2:1);if(s[1]=='1') p[z]++;
	}
	for(Po[0]=i=1;i<=m;i++) Po[i]=Po[i-1]*3;
	for(i=0;i<m-1;i++){
		for(h=0;h<Po[m-1];h+=Po[i]) if(h/Po[i]%3==0) for(j=h;j<h+Po[i];j++) p[j]+=p[j+Po[i]]+p[j+Po[i]*2];
	}
	FWT(f);FWT(g);
// 	inv[1]=1;for(i=2;i<=n;i++) inv[i]=(mod-inv[mod%i])*(mod/i)%mod;
	dp[k-1]=1;
	for(i=0;i<k;i++){
		for(j=0;j<m-1;j++) if(i>>j&1) To[i]+=Po[j];
	}
	cerr<<f[3]<<'\n';
	for(i=k-2;i>=tot;i--){
		for(j=(k-1)^i;j;j=(j-1)&((k-1)^i)) {
			dp[i]+=dp[i^j]*p[To[i]*2+To[j]]/(n-(f[i^j]+g[i^j]));
			// cerr<<p[To[i]*2+To[j]]<<' ';
		}
		// cerr<<i<<' '<<dp[i]<<'\n';
	}
	printf("%.11Lf\n",(n-g[tot]-f[tot]?0.0:dp[tot]));
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}
//0 1 0 1 0 1 0 1 0 0 1 1 0 0 0 1 0 1 0