#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
const double PI = acos(-1.0);
const double eps = 1e-6;
const int mod = 1e9 + 7;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int maxn = 2e6 + 7;
int T = 1, n, m;
int a[maxn], aa[maxn], b[maxn], c[maxn], f1[maxn], f2[maxn];

int lowbit(int x) {
    return x & (-x);
}

void init(int n) {
    for(int i = 0; i <= n; i++) {
        c[i] = 0;
    }
}

void updata(int i, int k, int n) {
    while (i <= n) {
        c[i] += k;
        i += lowbit(i);
    }
}

int query(int i) {
    int res = 0;
    while (i > 0) {
        res += c[i];
        i -= lowbit(i);
    }
    return res;
}

void solve() {
    map<int, int> mp;
    int cnt = 0;
    cin >> n >> m;
    for(int i = 1; i <= n; i++) cin >> a[i], aa[i] = a[i];
    int ans1 = 0;
    sort(a + 1, a + n + 1);
    for(int i = 1; i <= n; i++) {
        if(mp.count(a[i])) continue;
        mp[a[i]] = ++cnt;
    }
    init(cnt + 1);
    for(int i = 1; i <= n; i++) {
        ans1 += query(cnt) - query(mp[aa[i]]);
        updata(mp[aa[i]], 1, cnt);
    }

    while(m--) {
        int len = 0;
        cin >> len;
        for(int i = 1; i <= len; i++) cin >> b[i], aa[i] = b[i];

        f1[0] = 0;
        for(int i = 1; i <= len; i++) {
            int pos = lower_bound(a + 1, a + 1 + n, b[i]) - a - 1;
            if(pos == 0) f1[i] = f1[i - 1];
            else f1[i] = f1[i - 1] + pos;
        }
        f2[len] = 0;
        for(int i = len; i >= 1; i--) {
            int pos = upper_bound(a + 1, a + 1 + n, b[i]) - a;
            if(pos == n + 1) f2[i - 1] = f2[i];
            else f2[i - 1] = f2[i] + (n - pos + 1);
        }
        int ans3 = INF;
        for(int i = 0; i <= len; i++) {
            ans3 = min(f1[i] + f2[i], ans3);
        }

        mp.clear(); cnt = 0;
        sort(b + 1, b + 1 + len);
        for(int i = 1; i <= len; i++) {
            if(mp.count(b[i])) continue;
            mp[b[i]] = ++cnt;
        }
        init(cnt + 1);
        int ans2 = 0;
        for(int i = 1; i <= len; i++) {
            ans2 += query(cnt) - query(mp[aa[i]]);
            updata(mp[aa[i]], 1, cnt);
            // for(int i = 1; i <= cnt; i++) {
            //     cerr << query(i) << ", ";
            // }
            // cerr << '\n';
        }
        // cerr << ans1 << ' ' << ans2 << '\n';
        cout << ans1 + ans2 + ans3 << '\n';
    }   
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);

    // cin >> T;
    while (T--) {
        solve();
    }
    return 0;
}