#include <bits/stdc++.h>
using namespace std;

#define maxn 500005

typedef pair<int, int> pii;

vector<int> btn[maxn], fa[maxn];
int a[maxn], b[maxn], deg[maxn], odeg[maxn], op[maxn], f[3][maxn];
bool vis[maxn];

void solve(void) {
    int n, m;
    cin >> n >> m;
    string s;
    cin >> s;
    for (int i = 0; i < n; i++) a[i + 1] = b[i + 1] = (s[i] == 'R' ? 0 : (s[i] == 'G' ? 1 : 2));
    for (int i = 1, k, x; i <= m; i++) {
        cin >> k;
        while (k--) cin >> x, btn[i].push_back(x), fa[x].push_back(i), deg[x]++, odeg[x]++;
    }
    
    for (int i = 1; i <= n; i++)
        if (deg[i] == 0 && a[i] != 0) return cout << "impossible" << endl, void();

    queue<int> que;
    vector<int> btns, ptns;

    auto lim = [&](void) -> bool {
        while (!que.empty()) {
            int p = que.front();
            que.pop();
            for (auto i : btn[p]) {
                a[i] = (a[i] + op[p]) % 3, ptns.push_back(i);
                if (--deg[i] == 1) {
                    int x = fa[i][fa[i][0] == p], d = (3 - a[i]) % 3;
                    if (vis[x]) {
                        if (op[x] != d) return false;
                    } else
                        que.push(x), op[x] = d, vis[x] = true, btns.push_back(x);
                }
            }
        }
        return true;
    };

    for (int i = 1; i <= n; i++)
        if (deg[i] == 1) {
            int x = fa[i][0], d = (3 - a[i]) % 3;
            if (vis[x]) {
                if (op[x] != d) return cout << "impossible" << endl, void();
            } else
                que.push(x), op[x] = d, vis[x] = true;
        }

    if (!lim()) return cout << "impossible" << endl, void();

    for (int i = 1; i <= n; i++) {
        if (a[i] == 0) continue;
        int p = fa[i][0];
        pii cur = {INT_MAX, 0};
        for (op[p] = 0; op[p] < 3; op[p]++) {
            btns.clear(), ptns.clear();

            btns.push_back(p), vis[p] = true, que.push(p);
            int sum = 0;
            if (!lim())
                sum = INT_MAX;
            else
                for (auto b : btns) sum += op[b];

            for (auto b : btns) f[op[p]][b] = op[b], vis[b] = false;
            for (auto p : ptns) a[p] = b[p], deg[p] = odeg[p];

            cur = min(cur, pii{sum, op[p]});
        }
        if (cur.first == INT_MAX) return cout << "impossible" << endl, void();

        btns.clear(), ptns.clear();

        btns.push_back(p), op[p] = cur.second, vis[p] = true, que.push(p);
        lim();
    }

    int ans = 0;
    for (int i = 1; i <= m; i++) ans += op[i];
    cout << ans << endl;

    return;
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr);

    int _ = 1;
    while (_--) solve();

    return 0;
}