#include <iostream>
#include <algorithm>
#include <cstdio>
#include <vector>
#define REP(_i,_a,_n) for(int _i=_a;_i<=_n;++_i)
#define PER(_i,_a,_n) for(int _i=_n;_i>=_a;--_i)
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int P = 1e9+7, INF = 0x3f3f3f3f;
const int N = 1e6+10;
int n, k, fa[N], val[N];
char s[N];
vector<int> g[N];
int Find(int x) {return fa[x]?fa[x]=Find(fa[x]):x;}
void add(int x, int y) {
	x = Find(x), y = Find(y);
	if (x!=y) fa[x]=y,val[y]+=val[x];
}
int calc(int x) {
	return min(val[Find(x)],val[Find(x+k)]);
}

int main() {
	scanf("%d%d%s",&n,&k,s+1);
	REP(i,1,k) {
		int x, t;
		scanf("%d",&x);
		while (x--) {
			scanf("%d", &t);
			g[t].pb(i);
		}
	}
	REP(i,k+1,2*k) val[i] = 1;
	val[2*k+1] = INF;
	int ans = 0;
	REP(i,1,n) {
		if (g[i].size()==1) {
			ans -= calc(g[i][0]);
			if (s[i]=='1') add(g[i][0]+k,2*k+1);
			else add(g[i][0],2*k+1);
			ans += calc(g[i][0]);
		}
		else if (g[i].size()==2) {
			int x = g[i][0], y = g[i][1];
			if (Find(x)!=Find(y)&&Find(x)!=Find(y+k)) {
				ans -= calc(x)+calc(y);
				if (s[i]=='1') add(x,y),add(x+k,y+k);
				else add(x+k,y),add(x,y+k);
				ans += calc(x);
			}
		}
		printf("%d\n", ans);
	}
}