#include <bits/stdc++.h>

#define x first
#define y second
#define el '\n'
#define debug(x) cerr << #x << ": " << x << el
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int N = 2e5 + 10, INF = 0x3f3f3f3f, mod = 998244353;

bool st[N * 3];
int n, m, ans, cnt;
int c[N], cur[N];
vector<int> l[N], b[N * 2], used;

void dfs(int u) {
    used.emplace_back(u);
    st[u] = 1;
    for (int v: l[u]) {
        if (st[v + n]) continue;
        used.emplace_back(v + n);
        st[v + n] = 1;
        int t = (3 - cur[u]) % 3;
        cnt += t;
        for (int i: b[v]) cur[i] = (cur[i] + t) % 3;
        for (int i: b[v]) 
            if (i != u) 
                dfs(i);
    }
}

int main() {
    ios::sync_with_stdio(0); cin.tie(0);
    cin >> n >> m;
    string s; cin >> s;
    for (int i = 0; i < n; ++i) 
        if (s[i] == 'G') c[i + 1] = cur[i + 1] = 1;
        else if (s[i] == 'B') c[i + 1] = cur[i + 1] = 2;
    for (int i = 1; i <= m; ++i) {
        int sz; cin >> sz;
        b[i].resize(sz);
        for (int j = 0; j < sz; ++j) {
            cin >> b[i][j];
            l[b[i][j]].emplace_back(i);
        }
    }
    for (int i = 1; i <= n; ++i) {
        if (st[i]) continue;
        if (l[i].empty()) {
            if (c[i]) 
                return cout << "impossible\n", 0;
            continue;
        }
        if (l[i].size() == 1) {
            cnt = 0;
            dfs(i);
            ans += cnt;
            for (int j: used) 
                if (j <= n && cur[j]) 
                    return cout << "impossible\n", 0;
            used.clear();
            continue;
        }
        int mn = INF, e = l[i][0];
        vector<int> vec;
        for (int j = 0; j < 3; ++j) {
            cnt = j;
            for (int u: b[e]) cur[u] = (cur[u] + j) % 3;
            used.emplace_back(e + n);
            st[e + n] = 1;
            for (int u: b[e]) dfs(u);
            for (int u: used) {
                if (u <= n) {
                    if (cur[u]) cnt = INF;
                    cur[u] = c[u];
                }
                else st[u] = 0;
            }
            if (cnt < mn) mn = cnt, vec = move(used);
            used.clear();
            // debug(cnt);
        }
        if (mn == INF) return cout << "impossible\n", 0;
        for (int i: vec) 
            if (i <= n) 
                st[i] = 1;
        ans += mn;
    }
    cout << ans << el;
}