#include <bits/stdc++.h>
using namespace std;
const int N = 5e5 + 5;
using ll = long long;

int n, m, L[N], R[N];
vector<tuple<int, int, int> > q;
vector<int> id[N];
ll c[N], ans[N], sum;

int main() {
    ios::sync_with_stdio(false); cin.tie(0); cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= m; i++) cin >> c[i];
    for (int i = 1, k, x; i <= n; i++) {
        cin >> L[i] >> R[i] >> k;
        while (k--) { cin >> x; id[x].emplace_back(i); }
    }
    for (int i = 1; i <= m; i++) {
        for (int j : id[i]) { q.emplace_back(L[j], j, 1); q.emplace_back(R[j] + 1, j, -1); }
        sort(q.begin(), q.end());
        int cnt = 0, now = 0;
        for (int j = 0; j < (int)q.size() - 1; j++) {
            auto[a, b, c] = q[j];
            cnt += c; now ^= b;
            if (cnt) sum += 1ll * (::c[i]) * (get<0>(q[j + 1]) - a);
            if (cnt == 1) ans[now] += 1ll * (::c[i]) * (get<0>(q[j + 1]) - a);
        }
        q.clear();
    }
    for (int i = 1; i <= n; i++) cout << sum - ans[i] << " ";
    return 0;
}