#include <bits/stdc++.h>

using namespace std;

inline int read()
{
	int x=0;bool f=0;char ch=getchar();
	while(ch<'0' || ch>'9') {if(ch=='-') f=1;ch=getchar();}
	while(ch>='0' && ch<='9') x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return f?-x:x;
}

#define x first
#define y second
#define pb push_back
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)

typedef pair<int,int> PII;
typedef long long LL;
typedef unsigned long long ull;
const int N=5e5+10;

int n,m;
int c[N],s[N],nums[N],cnt;
LL sum,f[N];
struct Node{int l,r,id;}; vector<Node> p[N];

bool cmp(Node &a,Node &b) {return a.l<b.l;}
void find(int &x) {x=lower_bound(nums+1,nums+1+cnt,x)-nums;}

int main()
{
	n=read(),m=read();
	rep(i,1,m) c[i]=read();
	for(int i=1,l,r,s,x;i<=n;i++) {
		l=read(),r=read(),s=read();
		while(s--) x=read(),p[x].pb({l,r+1,i});
	}
	
	for(int i=1;i<=m;i++) {
		sort(p[i].begin(),p[i].end(),cmp),cnt=0;
		for(auto t:p[i]) nums[++cnt]=t.l,nums[++cnt]=t.r;
		sort(nums+1,nums+1+cnt),cnt=unique(nums+1,nums+1+cnt)-nums-1,nums[cnt+1]=nums[cnt];
		rep(i,0,cnt) s[i]=0;
		for(int j=0;j<(int)p[i].size();j++) find(p[i][j].l),find(p[i][j].r);
		for(auto t:p[i]) s[t.l]++,s[t.r]--;
		
		int tot=0;
		rep(i,1,cnt) s[i]+=s[i-1],tot+=(s[i]>0)*(nums[i+1]-nums[i]);
		rep(i,1,cnt) s[i]=s[i-1]+(s[i]==1)*(nums[i+1]-nums[i]);
		sum+=(LL)tot*c[i];
		for(auto t:p[i]) f[t.id]+=(LL)(s[t.r-1]-s[t.l-1])*c[i];
	}
	
	rep(i,1,n) printf("%lld ",sum-f[i]);
	
	return 0;
}