#include <bits/stdc++.h>

using namespace std;
using ll = long long;

vector<int> crr;
vector<int> fr;
int n, m, k;

ll cal(int nl, int mid, int nr, ll lh, ll rh, vector<int> arr) {
    ll ov = 0;
    int pn = mid - nl + 1, sn = nr - mid;
    int pre[pn] = {0}, suf[sn] = {0};
    for (int i = 0; i < pn; i++) {
        pre[i] = arr[nl+i];
    }
    for (int i = 0; i < sn; i++) {
        suf[i] = arr[mid+1+i];
    }
    int lp = 0, rp = 0, i;
    for (i = 0; lp < pn && rp < sn; i++) {
        if (pre[lp] > suf[rp]) {
            arr[nl+i] = suf[rp++];
            ov += pn - lp;
        }else {
            arr[nl+i] = pre[lp++];
        }
    }
    while (lp < pn) {
        arr[nl+i] = pre[lp++];
        i++;
    }
    while (rp < sn) {
        arr[nl+i] = suf[rp++];
        i++;
    }
    return ov + lh + rh;
}

ll inver(int nl, int nr, vector<int> arr) {
    if (nl == nr) {
        return 0LL;
    }
    int mid = (nl+nr)>>1;
    ll lh = inver(nl, mid, arr);
    ll rh = inver(mid+1, nr, arr);
    ll all = cal(nl, mid, nr, lh, rh, arr);
    return all;
}

signed main() {
    ios::sync_with_stdio(0), cin.tie(0);
    cin >> n >> m;
    for (int i = 0; i < n; i++) {
        int in;
        cin >> in;
        crr.push_back(in);
    }
    ll chin = inver(0, n-1, crr);
    while (m--) {
        ll ans = 0, temp = 0;
        cin >> k;
        fr = vector<int>();
        for (int i = 0; i < k; i++) {
            int in;
            cin >> in;
            fr.push_back(in);
        }
        for (int i = 0; i < k; i++) {
            temp += (ll)(crr.end() - upper_bound(crr.begin(), crr.end(), fr[i]));
        }
        ans = temp;
        for (int i = 0; i < k; i++) {
            temp += (ll)(lower_bound(crr.begin(), crr.end(), fr[i]) - crr.begin());
            temp -= (ll)(crr.end() - upper_bound(crr.begin(), crr.end(), fr[i]));
            //cout << temp << " ";
            ans = min(ans, temp);
        }
        ans += inver(0, k-1, fr);
        ans += chin;
        cout << ans << "\n";
    }
    return 0;
}