#include <iostream>
#include <cstdio>
#include <algorithm>
#include <vector>

template <typename Tp>
inline void read(Tp &x) {
    x = 0;
    bool f = true; char ch = getchar();
    for ( ; ch < '0' || ch > '9'; ch = getchar()) f ^= ch == '-';
    for ( ; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + (ch ^ 48);
    x = f ? x : -x;
}

const int N = 3e5;

int a[N + 5], b[N + 5];
std::vector<int> Vec[N + 5];

struct BIT {
    int c[N + 5];

    void add(int x, int k) {
        for ( ; x <= N; x += x & -x) c[x] += k;
    }
    int query(int x) {
        int res = 0;
        for ( ; x > 0; x -= x & -x) res += c[x];
        return res;
    }
};
BIT B1, B2;

int main() {
    int n, q;
    read(n), read(q);
    for (int i = 1; i <= n; ++i) {
        read(a[i]);
        b[i] = a[i];
    }
    int m = n;
    for (int i = 1; i <= q; ++i) {
        int k;
        read(k);
        Vec[i].resize(k);
        for (int j = 0; j < k; ++j) {
            read(Vec[i][j]);
            b[++m] = Vec[i][j];
        }
    }
    std::sort(b + 1, b + m + 1);
    m = std::unique(b + 1, b + m + 1) - (b + 1);
    for (int i = 1; i <= n; ++i) {
        a[i] = std::lower_bound(b + 1, b + m + 1, a[i]) - b;
        B1.add(a[i], 1);
    }
    for (int t = 1; t <= q; ++t) {
        long long cur = 0;
        for (int i = 1; i <= n; ++i) {
            cur += (i - 1) - B2.query(a[i]);
            B2.add(a[i], 1);
        }
        for (int i = 0; i < (int)Vec[t].size(); ++i) {
            Vec[t][i] = std::lower_bound(b + 1, b + m + 1, Vec[t][i]) - b;
            cur += (i + n) - B2.query(Vec[t][i]);
            B2.add(Vec[t][i], 1);
        }
        long long ans = cur;
        for (int i = 0; i < (int)Vec[t].size(); ++i) {
            cur += B1.query(Vec[t][i] - 1) - (n - B1.query(Vec[t][i]));
            ans = std::min(ans, cur);
        }
        printf("%lld\n", ans);
        for (int i = 1; i <= n; ++i) B2.add(a[i], -1);
        for (int i = 0; i < (int)Vec[t].size(); ++i) B2.add(Vec[t][i], -1);
    }
    return 0;
}