#pragma GCC optimize(2)

#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN=35,MAXM=105,B=12,MAXB=9;
int n,q;
char s[MAXM][MAXN];

int check(char s,char t){
	if(s=='?' || t=='?')return 1;
	return s==t;
}
bitset< (1<<15) > p[MAXB][1<<B],tmp[B],now;

int lb[1<<15],ans;
int tag[MAXM];

int main(){
	rep(i,0,14)lb[1<<i]=i;

	cin>>n>>q;
	rep(i,1,q)cin>>(s[i]+1);
	if(n==1){
		int f[2]={0,0};

		rep(i,1,q){
			f[0] |= check(s[i][1],'0');
			f[1] |= check(s[i][1],'1');
		}

		cout<<f[0]+f[1]<<endl;
		exit(0);
	}
	int m=n/2;
	//(0,m] and (m,n]
	for(int l=1,idx=0;l<=q;){
		int r=min(q,l+B-1);
		//[l,r]
		int len=r-l+1;

		rep(i,0,len-1)tmp[i].reset();

		rep(i,l,r){
			rep(j,0,(1<<(n-m))-1){
				int flag=1;
				rep(k,0,n-m-1){
					if(j>>k&1)flag &= check(s[i][m+k+1],'1');
					else flag &= check(s[i][m+k+1],'0');
				}
				if(flag)tmp[i-l][j]=1;
			}
		}

		rep(S,1,(1<<len)-1){
			p[idx][S] = p[idx][S^lowbit(S)] | tmp[lb[lowbit(S)]];
		}
		
		//
		l=r+1;idx++;
	}

	//
	
	rep(i,0,(1<<m)-1){

		rep(j,1,q){
			tag[j] = 1;
			rep(k,1,m){
				if(i>>(k-1)&1)tag[j] &= check(s[j][k],'1');
				else tag[j] &= check(s[j][k],'0');
			}
		}
		now.reset();

		for(int l=1,idx=0;l<=q;){
			int r=min(q,l+B-1);

			int len=r-l+1;
			int mask=0;
			rep(j,0,len-1)if(tag[l+j])mask |= (1<<j);

			now |= p[idx][mask];

			l=r+1,idx++;
		}

		ans += now.count();
	}
	

	cout<<ans;
    return 0;
}