#include<iostream>
#include<cstdio>
#define N 100000
#define M 5
#define K 10
#define mod 1000000007
using namespace std;
int read()
{
	char c=0;
	int sum=0;
	while (c<'0'||c>'9') c=getchar();
	while ('0'<=c&&c<='9') sum=sum*10+c-'0',c=getchar();
	return sum;
}
void Adder(int &x,int d)
{
	x=x+d>=mod?x+d-mod:x+d;
	return;
}
void Adder2(int &x,int d)
{
	x=x+d<0?x+d+mod:x+d;
	return;
}
int MD(int x)
{
	return x>=mod?x-mod:x;
}
int MD2(int x)
{
	return x<0?x+mod:x;
}
int fast_pow(int a,int b)
{
	int res=1,mul=a;
	while (b)
	{
		if (b&1) res=1ll*res*mul%mod;
		mul=1ll*mul*mul%mod,b>>=1;
	}
	return res;
}
struct matrix
{
	int d[K+1][K+1];
};
matrix e,c,res,zero;
int n,m,q,ds,ans,G[K+1][K+1],X[K+1],l[N+1][M+1],r[N+1][M+1],u[N+1][M+1],d[N+1][M+1];
matrix operator * (matrix a,matrix b)
{
	c=zero;
	for (int k=0;k<=(m<<1);++k)
		for (int i=0;i<=(m<<1);++i)
			if (a.d[i][k])
			{
				for (int j=0;j<=(m<<1);++j)
					if (b.d[k][j])
						Adder(c.d[i][j],1ll*a.d[i][k]*b.d[k][j]%mod);
			}
	return c;
}
matrix get(int x)
{
	int dw;
	c=zero,Adder(c.d[m<<1][m<<1],1);
	for (int i=0;i<m;++i) dw=fast_pow(d[x][i],mod-2),Adder(c.d[i+m][i],1),Adder(c.d[i+m][i+m],dw),Adder2(c.d[i][i+m],-1ll*u[x][i]*dw%mod),Adder2(c.d[(i+m-1)%m+m][i+m],-1ll*l[x][i]*dw%mod),Adder2(c.d[(i+1)%m+m][i+m],-1ll*r[x][i]*dw%mod),Adder2(c.d[m<<1][i+m],-dw);
	return c;
}
void gauss()
{
	int d,ds;
	for (int i=0;i<(m<<1);++i)
	{
		if (!G[i][i])
		{
			for (int j=i+1;j<(m<<1);++j)
				if (G[j][i])
				{
					swap(G[i],G[j]);
					break;
				}
		}
		d=fast_pow(G[i][i],mod-2);
		for (int j=i+1;j<(m<<1);++j)
		{
			ds=1ll*G[j][i]*d%mod;
			for (int k=i;k<=(m<<1);++k) Adder2(G[j][k],-1ll*G[i][k]*ds%mod);
		}
	}
	for (int i=(m<<1)-1;i>=0;--i)
	{
		X[i]=G[i][m<<1];
		for (int j=i+1;j<(m<<1);++j) Adder2(X[i],-1ll*G[i][j]*X[j]%mod);
		X[i]=1ll*X[i]*fast_pow(G[i][i],mod-2)%mod;
	}
	return;
}
struct seg
{
	struct node
	{
		int l,r;
		matrix data;
	};
	node tree[(N<<2)+1];
	void push_up(int k)
	{
		tree[k].data=tree[k<<1].data*tree[k<<1|1].data;
		return;
	}
	void build(int k,int l,int r)
	{
		tree[k].l=l,tree[k].r=r;
		if (l==r)
		{
			tree[k].data=get(l);
			return;
		}
		int mid=(l+r)>>1;
		build(k<<1,l,mid),build(k<<1|1,mid+1,r),push_up(k);
		return;	
	}
	void add(int k,int x)
	{
		if (tree[k].l==tree[k].r)
		{
			tree[k].data=get(x);
			return;
		}
		int mid=(tree[k].l+tree[k].r)>>1;
		if (x<=mid) add(k<<1,x);
		else add(k<<1|1,x);
		push_up(k);
		return;
	}
	matrix query(int k,int l,int r)
	{
		if (l>r) return e;
		if (tree[k].l==l&&tree[k].r==r) return tree[k].data;
		int mid=(tree[k].l+tree[k].r)>>1;
		if (r<=mid) return query(k<<1,l,r);
		else if (l>=mid+1) return query(k<<1|1,l,r);
		else return query(k<<1,l,mid)*query(k<<1|1,mid+1,r);
	}
};
seg T;
int main()
{
	int op,x,y,x1,y1,x2,y2;
	n=read(),m=read(),ds=fast_pow(100,mod-2);
	for (int i=0;i<=(m<<1);++i) e.d[i][i]=1;
	for (int i=0;i<n;++i)
		for (int j=0;j<m;++j)
			l[i][j]=1ll*read()*ds%mod;
	for (int i=0;i<n;++i)
		for (int j=0;j<m;++j)
			r[i][j]=1ll*read()*ds%mod;
	for (int i=0;i<n;++i)
		for (int j=0;j<m;++j)
			u[i][j]=1ll*read()*ds%mod;
	for (int i=0;i<n;++i)
		for (int j=0;j<m;++j)
			d[i][j]=1ll*read()*ds%mod;
	T.build(1,0,n-1),q=read();
	while (q--)
	{
		op=read();
		if (op==1) x=read(),y=read(),l[x][y]=1ll*read()*ds%mod,r[x][y]=1ll*read()*ds%mod,u[x][y]=1ll*read()*ds%mod,d[x][y]=1ll*read()*ds%mod,T.add(1,x);
		else
		{
			x1=read(),y1=read(),x2=read(),y2=read(),res=T.query(1,x2+1,n-1)*T.query(1,0,x2),ans=0;
			for (int i=0;i<(m<<1);++i)
			{
				if (i==y2+m)
				{
					for (int j=0;j<=(m<<1);++j) G[i][j]=0;
					G[i][y2]=1;
				}
				else
				{
					for (int j=0;j<(m<<1);++j) G[i][j]=res.d[j][i];
					Adder2(G[i][i],-1),G[i][m<<1]=MD2(-res.d[m<<1][i]);
				}
			}
			gauss(),X[m<<1]=1;
			if (x2<=x1) res=T.query(1,x2+1,x1);
			else res=T.query(1,x2+1,n-1)*T.query(1,0,x1);
			for (int i=0;i<=(m<<1);++i) Adder(ans,1ll*res.d[i][y1]*X[i]%mod);
			printf("%d\n",ans);
		}
	}
	return 0;
}