#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int N = 4e5 + 3, MOD = 998244353;//1e9 + 7;

int fr[N];

void add(vector<int> & BIT , int i , int val)
{
    i++;
    while(i <= (int)BIT.size() )
    {
        BIT[i-1] += val;
        i += i & -i ;
    }
}

int get(vector<int> & BIT , int i)
{
    i++;
    int ans= 0;
    while(i > 0)
    {
        ans += BIT[i-1];
        i -= i & - i ;
    }
    return ans ;
}

int32_t main() {

    cin.tie(0);cin.sync_with_stdio(0);
    cout.tie(0);cout.sync_with_stdio(0);

    int n ,m;
    cin >> n >> m;

    vector<int> all ;

    int a[n] ;
    for (int i = 0; i < n; ++i) {
        cin >> a[i] ;
        all.push_back(a[i]) ;
    }

    vector<int> ad[m] ;
    for (int i = 0; i < m; ++i) {
        int k ;
        cin >> k;
        ad[i].resize(k) ;
        for (int j = 0; j < k; ++j) {
            cin >> ad[i][j] ;

            all.push_back(ad[i][j]) ;
        }
    }

    sort(all.begin() ,all.end()) ;
    all.erase(unique(all.begin() , all.end()) , all.end() );


    for (int i = 0; i < n; ++i) {
        a[i] = lower_bound(all.begin() , all.end() , a[i]) - all.begin() + 1;

        fr[a[i]]++ ;
    }

    ll inv1 = 0 ;

    vector<int> B(3e5 + 2) ;
    vector<int> B2(3e5 + 2) ;

    for(int i = n-1 ;i >= 0;i--)
    {
        inv1 += get( B , a[i] - 1 ) ;

        add(B , a[i] , 1) ;
    }

    for(int i =1;  i <N ; i++ ) fr[i] += fr[i-1] ;

    for (int i = 0; i < m; ++i) {

        int k = (int)ad[i].size() ;

        ll inv2 = 0 ;

        for(int j = k-1 ; j >=0 ; j--)
        {
            ad[i][j] = lower_bound(all.begin() , all.end() , ad[i][j]) - all.begin() + 1;

            inv2 += get(B2 , ad[i][j] - 1) ;
            add(B2 , ad[i][j] , 1) ;
        }

        vector<ll> te(k+1) , te2(k+1) ;
        for(int j = 0 ;j < k; j++)
        {
            te[j+1] = fr[ ad[i][j] - 1 ] ;
            te[j+1] += te[j] ;
        }

        for(int j = k-1 ; j >= 0 ; j--)
        {
            te2[j] = fr[N-1] - fr[ ad[i][j] ] ;
            te2[j] += te2[j+1] ;
        }

        ll ans = 1e18 ;

        for (int j = 0; j < k + 1; ++j) {
            ans = min(ans , inv1 + inv2 + te[j] + te2[j]) ;
        }

        cout << ans  << "\n" ;

        for(int j =0 ; j < k; j++)
        {
            add(B2 , ad[i][j] , -1 ) ;
        }
    }

    return 0;
}