#include <iostream>
#include <vector>
using namespace std;
int n,m;
long long s=0;
vector< vector<long long> > table;
vector<long long> tmp;

void Solve()
{
    tmp.clear();
    int p,x,y,v,z,t,news=0;
    cin>>p>>x>>y>>v>>z>>t;
    int l,r,i,j;
    p--;
    l = (x+s)%m + 1;
    r = (y+s)%m + 1;
    i = (z+s)%m;
    j = (t+s)%m;
    for(int ii=0;ii<m;ii++)
    {
        tmp.push_back(table[p][ii]);
        if(ii>=l && ii<=r)
        {
            tmp[ii]+=v;
        }
        if(ii>=i && ii<=j)
        {
            news+=tmp[ii];
        }
    }
    table.push_back(tmp);
    cout<<news<<endl;
    s=news;
}

int main ()
{
	cin>>n>>m;
	for(int i=0;i<m;i++)
	{
	    int inp;
	    cin>>inp;
	    tmp.push_back(inp);
	}
	table.push_back(tmp);
	
	for(int i=1;i<n;i++)
        Solve();
	return 0;
}