#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
const ll N = 5e5+5;
ll n, m;
ll a[N];

struct node {
    ll id, dt;
    bool f;
};

vector <node> v[N];
ll ans[N];

bool cmp (node x, node y) {
    return x.dt < y.dt;
}

void solve () {
    cin >> m >> n;
    for (ll i=1; i<=n; i++)
        cin >> a[i];
    for (ll i=1; i<=m; i++) {
        ll l, r, k;
        cin >> l >> r >> k;
        for (ll j=1; j<=k; j++) {
            ll q;
            cin >> q;
            v[q].push_back ({i, l, 1});
            v[q].push_back ({i, r+1, 0});
        }
    }
    for (ll i=1; i<=n; i++)
        sort (v[i].begin(), v[i].end(), cmp);

    // for (ll i=1; i<=n; i++) {
    //     cout << i << "\n";
    //     for (ll j=0; j<v[i].size(); j++) {
    //         cout << v[i][j].id << ' ' << v[i][j].dt << ' ' << v[i][j].f << '\n';
    //     }
    // }
    ll totans=0;
    for (ll i=1; i<=n; i++) {
        ll c=0;
        set <int> s;
        for (ll j=0; j+1<v[i].size(); j++) {
            auto now = v[i][j], nxt = v[i][j+1];
            if (now.f == 1) {s.insert(now.id);}
            else {s.erase(now.id);}
            if (s.size() == 1) {
                ll len = nxt.dt-now.dt;
                ll x = *s.begin();
                ans[x] -= 1ll*a[i]*len;
            }
            if (!s.empty())
                totans += 1ll*a[i]*(nxt.dt - now.dt);
        }
    }
    for (ll i=1; i<=m; i++)
        cout << ans[i]+totans << ' ';
}

int main () {
    ios::sync_with_stdio(false);
    solve ();
}