#include <bits/stdc++.h>
using namespace std;
int n,m;
int c[500010];
int l[500010],r[500010],k[500010];
bool yao[5010][5010];
int len[500010],y[500010];
int ma[1000010];
int x;
int ld;
bool f[5010];
long long ans;
int main()
{
	//freopen("doctor.in","r",stdin);
	//freopen("doctor.out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	cin >> n >> m;
	for (int i=1;i<=m;i++) cin >> c[i];
	if (n>1&&m==1)
	{
		for (int i=1;i<=n;i++) cin >> l[i] >> r[i] >> k[i] >> x;
		ans=c[1]*n;
		for (int i=1;i<=n;i++)
		{
			for (int j=l[i];j<=r[i];j++)
			{
				ma[j]++;
			}
		}
		cout << ans;
	}
	else if (n<=5000)
	{
		for (int i=1;i<=n;i++)
		{
			cin >> l[i] >> r[i] >> k[i];
			ld=max(ld,r[i]);
			for (int j=1;j<=k[i];j++) cin >> x,yao[i][x]=true;
		}
		for (int i=1;i<=n;i++)
		{
			ans=0;
			for (int j=1;j<=ld;j++)
			{
				memset(f,false,sizeof f);
				for (int k=1;k<=n;k++)
				{
					if (i==k) continue;
					if (j>=l[k]&&j<=r[k])
					{
						for (int a=1;a<=m;a++)
						{
							if (yao[k][a]&&!f[a])
							{
								ans+=c[a];
								f[a]=true;
							}
						}
					}
				}
			}
			cout << ans << " ";
		}
	}
	else
	{
		for (int i=1;i<=n;i++)
		{
			cin >> l[i] >> r[i] >> k[i];
			len[i]=r[i]-l[i]+1;
			for (int j=1;j<=k[i];j++) cin >> x,y[i]+=c[x];
			ans+=y[i]*len[i];
		}
		for (int i=1;i<=n;i++) cout << ans-1ll*y[i]*len[i] << " ";
	}
	
	return 0;
}