#include<cstdio>
#include<cstring>
#include<algorithm>
#include<vector>
#include<cassert>
#include<set>
#include<bitset>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<iostream>

using namespace std;
const int maxn=1e5+5, maxm=2e3+5, inf=2e9, P=998244353, bs=661;
const double eps=1e-10, pi=3.1415926535897932384;
typedef long long LL;
typedef unsigned long long ULL;
const LL INF=4e18;
typedef pair<LL, int> pli;
typedef pair<int, int> pii;
typedef pair<LL, LL> pll;
inline int read() {
	int x=0, f=1; char c=getchar();
	for(; c<'0'||c>'9'; c=getchar()) if(c=='-') f=0;
	for(; c>='0'&&c<='9'; c=getchar()) x=x*10+c-'0';
	return f?x:-x;
}

inline int add(int x, int y) {x+=y; return x>=P?x-P:x;}
inline int del(int x, int y) {x-=y; return x<0?x+P:x;}
inline int ksm(int x, int y) {
	int s=1; for(; y; y>>=1, x=1LL*x*x%P) if(y&1) s=1LL*s*x%P; return s;
}
struct pj{
	int a[3][3];
	pj() {memset(a, 0, sizeof a);}
	void set1() {
		for(int i=0; i<3; ++i) for(int j=0; j<3; ++j) a[i][j]=i==j; 
	}
	pj operator*(const pj& b) const {
		pj c;
		for(int i=0; i<3; ++i)
			for(int k=0; k<3; ++k)
				for(int j=0; j<3; ++j) c.a[i][j]=add(c.a[i][j], 1LL*a[i][k]*b.a[k][j]%P);
		return c;
	}
};

pj mat(int a, int b, int c) {
	pj ret; int inv=ksm((1LL*a*a+1LL*b*b)%P, P-2);
	ret.a[0][0]=1LL*del(1LL*b*b%P, 1LL*a*a%P)*inv%P;
	ret.a[1][1]=del(0, ret.a[0][0]);
	ret.a[1][0]=ret.a[0][1]=del(0, 2LL*a*b%P*inv%P);
	ret.a[2][0]=del(0, 2LL*a*c%P*inv%P);
	ret.a[2][1]=del(0, 2LL*b*c%P*inv%P);
	ret.a[2][2]=1;
	return ret;
}
pj mat(int x0, int y0, int a, int b, int c) {
	int co=ksm(c, P-2), si=1LL*a*co%P; co=1LL*co*b%P; pj ret;
	ret.a[0][0]=ret.a[1][1]=co; ret.a[0][1]=si; ret.a[1][0]=del(0, si);
	ret.a[2][0]=add(del(x0, 1LL*x0*co%P), 1LL*y0*si%P);
	ret.a[2][1]=del(del(y0, 1LL*x0*si%P), 1LL*y0*co%P);
	ret.a[2][2]=1;
	return ret;
}
pj mat(int x, int y) {
	pj ret;
	ret.a[0][0]=x, ret.a[0][1]=y, ret.a[0][2]=1;
	return ret;
}

struct tg{
	pj val, nval, tagl, tagr; int tag;
} tr[maxn<<2];
pj a[maxn], na[maxn];

void build(int u, int l, int r) {
	tr[u].tagl.set1(); tr[u].tagr.set1(); tr[u].tag=0;
	if(l==r) {
		tr[u].val=a[l];
		tr[u].nval=na[l];
		return;
	}
	int mid=(l+r)>>1;
	build(u<<1, l, mid); build(u<<1|1, mid+1, r);
	tr[u].val=tr[u<<1].val*tr[u<<1|1].val;
	tr[u].nval=tr[u<<1].nval*tr[u<<1|1].nval;
}
void pushdown(int u) {
	tr[u<<1].val=tr[u].tagl*tr[u<<1].val*tr[u].tagr,
	tr[u<<1].nval=tr[u].tagl*tr[u<<1].nval*tr[u].tagr,
	tr[u<<1|1].val=tr[u].tagl*tr[u<<1|1].val*tr[u].tagr;
	tr[u<<1|1].nval=tr[u].tagl*tr[u<<1|1].nval*tr[u].tagr;
	if(tr[u].tag) 
		swap(tr[u<<1].val, tr[u<<1].nval), swap(tr[u<<1|1].val, tr[u<<1|1].nval),
		tr[u<<1].tag^=1, tr[u<<1|1].tag^=1;
	tr[u].tag=0; tr[u].tagl.set1(); tr[u].tagr.set1();
}
void modify(int u, int l, int r, int l0, int r0, pj nm, pj m, int rev) {
	if(l0<=l&&r<=r0) {
		tr[u].val=nm*tr[u].val*m;
		tr[u].nval=nm*tr[u].nval*m;
		tr[u].tagl=nm*tr[u].tagl;
		tr[u].tagr=tr[u].tagr*m;
		if(rev) tr[u].tag^=1, swap(tr[u].val, tr[u].nval);
		return;
	}
	pushdown(u);
	int mid=(l+r)>>1;
	if(l0<=mid) modify(u<<1, l, mid, l0, r0, nm, m, rev);
	if(r0>mid) modify(u<<1|1, mid+1, r, l0, r0, nm, m, rev);
	tr[u].val=tr[u<<1].val*tr[u<<1|1].val;
	tr[u].nval=tr[u<<1].nval*tr[u<<1|1].nval;
}

pj query(int u, int l, int r, int l0, int r0) {
	if(l0<=l&&r<=r0) return tr[u].val;
	int mid=(l+r)>>1; pushdown(u);
	pj ret; ret.set1();
	if(l0<=mid) ret=ret*query(u<<1, l, mid, l0, r0);
	if(r0>mid) ret=ret*query(u<<1|1, mid+1, r, l0, r0); 
	return ret;
}

int main() {
	int n=read(), q=read();
	for(int i=1; i<=n; ++i) {
		int ty=read();
		if(ty==1) {
			int aa=(read()%P+P)%P, bb=(read()%P+P)%P, cc=(read()%P+P)%P;
			a[i]=na[i]=mat(aa, bb, cc);
		} else if(ty==2) {
			int x0=(read()%P+P)%P, y0=(read()%P+P)%P, aa=(read()%P+P)%P, bb=(read()%P+P)%P, cc=(read()%P+P)%P;
			a[i]=mat(x0, y0, aa, bb, cc);
			na[i]=mat(x0, y0, del(0, aa), bb, cc);
		}
	}
	build(1, 1, n); 
	for(int ty; q--; ) {
		ty=read();
		if(ty==1) {
			int x=(read()%P+P)%P, y=(read()%P+P)%P, l=read(), r=read();
			pj ans=mat(x, y)*query(1, 1, n, l, r);
			//pj ans=mat(x, y);
			//for(int i=l; i<=r; ++i) ans=ans*a[i];
			printf("%d %d\n", ans.a[0][0], ans.a[0][1]);
		} else if(ty==2) {
			int aa=(read()%P+P)%P, bb=(read()%P+P)%P, cc=(read()%P+P)%P, l=read(), r=read();
			modify(1, 1, n, l, r, mat(aa, bb, cc), mat(aa, bb, cc), 1);
			//for(int i=l; i<=r; ++i)
			//	a[i]=mat(aa, bb, cc)*a[i]*mat(aa, bb, cc),
			//	na[i]=mat(aa, bb, cc)*na[i]*mat(aa, bb, cc), swap(a[i], na[i]); 
		} else if(ty==3) {
			int x0=(read()%P+P)%P, y0=(read()%P+P)%P, aa=(read()%P+P)%P, bb=(read()%P+P)%P, cc=(read()%P+P)%P, l=read(), r=read();
			modify(1, 1, n, l, r, mat(x0, y0, del(0, aa), bb, cc), mat(x0, y0, aa, bb, cc), 0);
			//for(int i=l; i<=r; ++i)
			//	a[i]=mat(x0, y0, del(0, aa), bb, cc)*a[i]*mat(x0, y0, aa, bb, cc),
			//	na[i]=mat(x0, y0, del(0, aa), bb, cc)*na[i]*mat(x0, y0, aa, bb, cc);
		}
	} 
	return 0;
}