#include using namespace std; typedef long long ll; typedef vector vi; typedef int _loop_int; #define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i) #define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i) #define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i) #define DEBUG(x) cout<<#x<<": "< P; typedef vector mat; mat mulmat(mat a,mat b){ assert(a.size()>0 && b.size()>0 && a.size()==b[0].size()); int n=a.size(), m=a[0].size(), l=b.size(); mat ret(l,vi(m,0)); REP(i,l)REP(j,m)REP(k,n)ret[i][j]=(ret[i][j]+a[k][j]*b[i][k])%MOD; return ret; } mat mulmat(mat a,ll k){ mat ret(a.size(),vi(a[0].size())); REP(i,a.size())REP(j,a[0].size())ret[i][j]=a[i][j]*k%MOD; return ret; } mat addmat(mat a,mat b){ assert(a.size()>0 && a.size()==b.size() && a[0].size()==b[0].size()); mat ret(a.size(),vi(a[0].size())); REP(i,a.size())REP(j,a[0].size())ret[i][j]=(a[i][j]+b[i][j])%MOD; return ret; } int n; mat a0,bn; char qbuf[52]; map amat,bmat; map avecmap; mat sigma(int beg,int end){ // calc sigma a_beg to a_end mat ret = mat(1,vi(2,0)); if(beg>end)return ret; int cur = beg; map::iterator iter1;//,iter2; iter1 = avecmap.upper_bound(beg); iter1--; mat ai = iter1->second; int last = beg; iter1++; while(iter1!=avecmap.end()){ int y = iter1->first; if(y>end)break; mat ci = mat(3,vi(2,6*beg)); REP(i,3)REP(j,2)ci[i][j]+=3*j+i; ci = mulmat(ci,ai); int k = y-last; ret = addmat(ret,mulmat(ci,k)); ll s = (ai[0][0]+ai[0][1]+ai[0][2])%MOD; ll po = k*(k-1)/2%MOD*s*6%MOD; ret[0][0]=(ret[0][0]+po)%MOD; ret[0][1]=(ret[0][1]+po)%MOD; last = y; ai = iter1->second; iter1++; } if(last<=end){ mat ci = mat(3,vi(2,6*last)); REP(i,3)REP(j,2)ci[i][j]+=3*j+i; ci = mulmat(ci,ai); int k = end-last+1; ret = addmat(ret,mulmat(ci,k)); ll s = (ai[0][0]+ai[0][1]+ai[0][2])%MOD; ll po = k*(k-1)/2%MOD*s*6%MOD; ret[0][0]=(ret[0][0]+po)%MOD; ret[0][1]=(ret[0][1]+po)%MOD; } return ret; } int main(){ scanf("%d",&n); { int x,y,z; scanf("%d%d%d",&x,&y,&z); a0 = mat(1,vi(3)); a0[0][0]=x; a0[0][1]=y; a0[0][2]=z; } { int x,y; scanf("%d%d",&x,&y); bn = mat(1,vi(2)); bn[0][0]=x; bn[0][1]=y; } int q; scanf("%d",&q); while(q--){ int x; scanf("%s",qbuf); scanf("%d",&x); if(qbuf[0]=='a'){ // change A query mat po(3,vi(3)); REP(j,3)REP(i,3)scanf("%lld",&po[i][j]); amat[x] = po; }else if(qbuf[0]=='b'){ // change B query mat po(2,vi(2)); REP(j,2)REP(i,2)scanf("%lld",&po[i][j]); bmat[x] = po; }else if(qbuf[1]=='a'){ // calc A query mat ans = a0; map::iterator iter = amat.begin(); while(iter!=amat.end()){ int y = iter->first; if(y>=x)break; ans = mulmat(iter->second,ans); iter++; } printf("%lld %lld %lld\n",ans[0][0],ans[0][1],ans[0][2]);fflush(stdout); }else if(qbuf[1]=='b'){ // calc B query avecmap.clear(); avecmap[0] = a0; mat cur = a0; map::iterator iter = amat.begin(); while(iter!=amat.end()){ int y = iter->first; cur = mulmat(iter->second,cur); avecmap[y+1] = cur; iter++; } map::reverse_iterator iter2 = bmat.rbegin(); mat ans = bn; int last = n; while(iter2!=bmat.rend()){ int y = iter2->first; if(y<=x)break; ans = addmat(ans,sigma(y+1,last)); ans = mulmat(iter2->second,ans); last = y; iter2++; } ans = addmat(ans,sigma(x+1,last)); printf("%lld %lld\n",ans[0][0],ans[0][1]);fflush(stdout); } } return 0; }