自认为复杂度正确，但是 80 pts 一直过不了。

//the code is from chenjh
#include<cstdio>
#include<cstring>
#define MAXN 250005
#define per(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define lson rt<<1
#define rson rt<<1|1
typedef long long LL;
int n,q;
const int mod=998244353;
template <typename _Tp,const int N>
struct Mat{
	_Tp a[N][N];
	Mat(){memset(a,0,sizeof a);}
	Mat(const _Tp b[N][N]){per(i,0,N)per(j,0,N)a[i][j]=b[i][j];}
	_Tp*operator[](int x){return a[x];}
	Mat operator*(const Mat b){
		Mat c;
		per(i,0,N)per(j,0,N)per(k,0,N)c[i][j]=(c[i][j]+(LL)a[i][k]*b.a[k][j])%mod;
		return c;
	}
	Mat operator+(const Mat b){
		Mat c;
		per(i,0,N)c[0][i]=((LL)a[0][i]+b.a[0][i])%mod;
		return c;
	}
	Mat&operator+=(const Mat b){return *this=*this+b;}
	Mat&operator*=(const Mat b){return *this=*this*b;}
	inline void init(){memset(a,0,sizeof a);a[0][0]=a[1][1]=a[2][2]=a[3][3]=1;}
};
Mat<int,4> a[MAXN],sum[MAXN<<2],lazy[MAXN<<2];
void build(int rt,int l,int r){
	lazy[rt].init();
	if(l==r){sum[rt]=a[l];return;}
	int mid=(l+r)>>1;
	build(lson,l,mid);
	build(rson,mid+1,r);
	sum[rt]=sum[lson]+sum[rson];
}
bool lz(int rt){
	per(i,0,4)per(j,0,4)if((i==j&&sum[rt][i][j]!=1) || (i!=j&&sum[rt][i][j]))return 0;
	return 1;
}
void pd(int rt){
	if(lz(rt)) return;
	sum[lson]*=lazy[rt];
	sum[rson]*=lazy[rt];
	lazy[lson]*=lazy[rt];
	lazy[rson]*=lazy[rt];
	lazy[rt].init();
}
void update(int rt,int l,int r,int L,int R,const int v,const int op){
	if(L<=l && r<=R){
		Mat<int,4>b;
		b.init();
		if(op==1) b[1][0]=1;
		else if(op==2) b[2][1]=1;
		else if(op==3) b[0][2]=1;
		else if(op==4) b[3][0]=v;
		else if(op==5) b[1][1]=v;
		else if(op==6) b[2][2]=0,b[3][2]=v;
		sum[rt]*=b,lazy[rt]*=b;
		return;
	}
	pd(rt);
	int mid=(l+r)>>1;
	if(L<=mid) update(lson,l,mid,L,R,v,op);
	if(mid<R) update(rson,mid+1,r,L,R,v,op);
	sum[rt]=sum[lson]+sum[rson];
}
Mat<int,4> query(int rt,int l,int r,int L,int R){
	if(L<=l && r<=R) return sum[rt];
	pd(rt);
	int mid=(l+r)>>1;
	Mat<int,4>ret;
	if(L<=mid) ret+=query(lson,l,mid,L,R);
	if(mid<R) ret+=query(rson,mid+1,r,L,R);
	return ret;
}
int main(){
	scanf("%d",&n);
	for(int i=1,A,B,C;i<=n;i++){
		scanf("%d%d%d",&A,&B,&C);
		int tmp[4][4]={{A,B,C,1}};
		a[i]=Mat<int,4>(tmp);
	}
	build(1,1,n);
	scanf("%d",&q);
	for(int op,l,r,v;q--;){
		scanf("%d%d%d",&op,&l,&r);
		if(op==7){
			Mat<int,4>ans=query(1,1,n,l,r);
			per(i,0,3) printf("%d ",ans[0][i]);
			putchar('\n');continue;
		}
		if(op>3)scanf("%d",&v);else v=0;
		update(1,1,n,l,r,v,op);
	}
	return 0;
}