#include using namespace std; #define F first #define S second #define R cin>> #define ln cout<<'\n' #define ll long long #define in(a) insert(a) #define pb(a) push_back(a) #define pd(a) printf("%.12f\n",a) #define mem(a) memset(a,0,sizeof(a)) #define all(c) (c).begin(),(c).end() #define iter(c) __typeof((c).begin()) #define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--) #define REP(i,m,n) for(ll i=(ll)(m);i<(ll)(n);i++) #define rep(i,n) REP(i,0,n) #define tr(it,c) for(iter(c) it=(c).begin();it!=(c).end();it++) ll check(ll n,ll m,ll x,ll y){return x>=0&&x=0&&yvoid pr(const A &a,const B&...b){cout<void PR(A a,ll n){rep(i,n)cout<<(i?" ":"")< P; ll p[200001],r[200001],c[200001],cnt; void init(ll n){rep(i,n)p[i]=i,r[i]=0,c[i]=-1;} int find(int x){return (p[x]==x)?x:(p[x]=find(p[x]));} void unite(int x,int y) { x=find(x),y=find(y); if(x==y)return; ll cx=c[x],cy=c[y]; if(cx==-1||cy==-1) cnt--; if(cx!=cy&&cx>=0&&cy>=0) cnt=-1; if(r[x]> n >> T; init(n); cnt=n; set se; while(T--) { string s; cin >> s; vector v[26]; rep(i,n) { if(isalpha(s[i])) { v[s[i]-'a'].pb(i); } else if(isdigit(s[i])) { if(c[find(i)]!=-1&&c[find(i)]!=s[i]-'0') cnt=-1; if(c[find(i)]==-1) cnt--; c[find(i)]=s[i]-'0'; } } rep(i,26) { REP(j,1,v[i].size()) unite(v[i][0],v[i][j]); } if(cnt<0) { pr(0); continue; } pr(d[cnt]); } } int main(){ios::sync_with_stdio(0);cin.tie(0);Main();return 0;}