#include<bits/stdc++.h>
using namespace std;
typedef long long int ll;
typedef pair<int,int> pii;
typedef vector<int> vii;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef unordered_map<int,int> umap;
typedef long double ld;
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define popcount __builtin_popcount
#define case cout<<"Case "<<__testcase-testcase<<": ";
#define endl '\n'


vii sg;
void upd(int u,int n){
    int s=0, e=n-1;
    int i=0;
    while(s<e){
        sg[i]++;
        int m=s+(e-s)/2;
        if(u<=m) e=m,i=2*i+1;
        else s=m+1,i=2*i+2;
    }
    sg[i]++;
    return;
}

int query(int s,int e,int st,int et,int i=0){
    if(e<s) return 0;
    if(s==st && e==et) return sg[i];
    int m=st+(et-st)/2;
    if(e<=m) return query(s,e,st,m,2*i+1);
    else if(s>m) return query(s,e,m+1,et,2*i+2);
    else{
        return query(s,m,st,m,2*i+1)+query(m+1,e,m+1,et,2*i+2);
    }
}
ll calculate_inversion(vii a){
    int msk;
    vii aa;
    aa.clear();
    map<int,int> mp;
    aa=a;
    sort(aa.begin(), aa.end());
    msk=0;
    mp[aa[0]]=msk++;
    int i, n=a.size();
    for(i=1;i<n;i++) if(aa[i]!=aa[i-1]) mp[aa[i]]=msk++;
    for(i=0;i<n;i++) aa[i]=mp[a[i]];
    sg.clear();
    sg.assign(4*msk+4,0);
    ll inv=0;
    for(i=0;i<n;i++){
        inv+=query(aa[i]+1,msk-1, 0,msk-1,0);
        upd(aa[i], msk);
    }
    return inv;
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    int testcase=1;
    //cin>>testcase;
    int __testcase=testcase;
    while(testcase--){
        int n,m,i,j,k;
        cin>>n>>m;
        vii a(n); for(auto &i: a) cin>>i;
        vector<vii> f(m);
        vector<ll> ans(m);
        for(i=0;i<m;i++){
            cin>>k;
            f[i].resize(k);
            for(auto &j: f[i]) cin>>j;
            ans[i]=calculate_inversion(f[i]);
        }

        ll base = calculate_inversion(a);
        //cout<<base<<endl;
        sort(a.begin(), a.end());
        //for(auto i: ans) cout<<i<<" "; cout<<endl;
        for(i=0;i<m;i++){
            vll x(f[i].size()); for(j=0;j<f[i].size();j++) x[j]=n-(int)(upper_bound(a.begin(), a.end(), f[i][j]) - a.begin());
            ll answer=ans[i]; for(auto j: x) answer+=j;
            ll val=answer;
            //cout<<answer<<endl;
            for(j=0;j<f[i].size();j++){
                ll v=(int)(lower_bound(a.begin(), a.end(), f[i][j])-a.begin());
                val=val+v-x[j];
                answer=min(answer, val);
                //cout<<v<<" "<<x[j]<<endl;
            }
            cout<<base+answer<<endl;
        }


    }
}