#include <bits/stdc++.h>

#define el '\n'
#define Beevo ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);

typedef long long ll;
typedef long double ld;

using namespace std;

mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;

template<typename T>
using ordered_multiset = tree<T, null_type, less_equal<T>, rb_tree_tag, tree_order_statistics_node_update>;

const ll INF = 1e18;
const int N = 2e5 + 5;

ll cntC;
ordered_multiset<int> st;
int n, l, c[N], w[N];

ll solve(int m) {
    ll cnt = 0;

    for (int i = 0; i < m; i++)
        cnt += lower_bound(c, c + n, w[i]) - c;

    for (int i = m; i < l; i++)
        cnt += n - (upper_bound(c, c + n, w[i]) - c);

    return cnt;
}

void testCase() {
    int m;
    cin >> n >> m;

    for (int i = 0; i < n; i++)
        cin >> c[i], cntC += st.size() - st.order_of_key(c[i] + 1), st.insert(c[i]);

    sort(c, c + n);

    int s, e, m1, m2;
    ll sol, sol1, sol2, curCnt;
    for (int i = 0; i < m; i++) {
        cin >> l;

        st.clear();

        curCnt = 0;
        for (int j = 0; j < l; j++)
            cin >> w[j], curCnt += st.size() - st.order_of_key(w[j] + 1), st.insert(w[j]);

        s = 0, e = l, sol = INF;
        while (s <= e) {
            m1 = s + (e - s) / 3;
            m2 = e - (e - s) / 3;

            sol1 = solve(m1), sol2 = solve(m2);

            sol = min({sol, sol1, sol2});

            if (sol1 < sol2)
                e = m2 - 1;
            else
                s = m1 + 1;
        }

        cout << cntC + curCnt + sol << el;
    }
}

signed main() {
    Beevo

    int t = 1;
//    cin >> t;

    while (t--)
        testCase();
}