#include <bits/stdc++.h>
#define int long long
#define fi first
#define se second
#define eb emplace_back
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
void chmin(int &x,int y){x=(x>y?y:x);}
void chmax(int &x,int y){x=(x<y?y:x);}
int read() {
  int p = 0, flg = 1;
  char c = getchar();
  while (c < '0' || c > '9') {if (c == '-') flg = -1; c = getchar();}
  while (c >= '0' && c <= '9') {p = p * 10 + c - '0';c = getchar();}
  return p * flg;
}

const int N=4e5+5,mod=1e9+7;
int n,m,T,k,l[N][10],r[N][10],u[N][10],d[N][10],f[N][10];

int xu(int i) {return (i+m-1)%m;}
int xd(int i) {return (i+1)%m;}
int xl(int i) {return (i+n-1)%n;}
int xr(int i) {return (i+1)%n;}
int ksm(int x,int y,int r=1) {
  for(;y;y>>=1,x=x*x%mod) if(y&1) r=r*x%mod;
  return r;
}

struct vec {int f[12];};
vec operator * (vec x,int a) {
  rep(i,0,k) x.f[i]=x.f[i]*a%mod;
  return x;
}
vec operator + (vec x,vec y) {
  rep(i,0,k) x.f[i]=(x.f[i]+y.f[i]>=mod?x.f[i]+y.f[i]-mod:x.f[i]+y.f[i]);
  return x;
}
void add(vec &x,vec y) {
  rep(i,0,k) x.f[i]=(x.f[i]+y.f[i]>=mod?x.f[i]+y.f[i]-mod:x.f[i]+y.f[i]);
}
vec operator - (vec x,vec y) {
  rep(i,0,k) x.f[i]=(x.f[i]-y.f[i]<0?x.f[i]-y.f[i]+mod:x.f[i]-y.f[i]);
  return x;
}

struct node {vec a[10];} s[N<<2];
node operator * (node x,node y) {
  node z;
  rep(i,0,k-1) {
    vec res; rep(i,0,11) res.f[i]=0; res.f[k]=y.a[i].f[k];
    rep(j,0,k-1) if(y.a[i].f[j]) add(res,x.a[j]*y.a[i].f[j]); z.a[i]=res;
  }
  return z;
}
#define ls (p<<1)
#define rs (p<<1|1)
void build(int p,int L,int R) {
  if(L==R) {
    int x=L;
    rep(i,0,m-1) s[p].a[i].f[i+m]=1;
    rep(i,0,m-1) {
      s[p].a[i+m].f[i+m]=1;
      (s[p].a[i+m].f[xu(i)+m]+=mod-u[x][i])%=mod;
      (s[p].a[i+m].f[xd(i)+m]+=mod-d[x][i])%=mod;
      s[p].a[i+m].f[i]=mod-l[x][i];
      s[p].a[i+m].f[k]=mod-1;
      int qr=ksm(r[x][i],mod-2);
      rep(j,0,k) (s[p].a[i+m].f[j]*=qr)%=mod;
    }
    return;
  } int mid=L+R>>1;
  build(ls,L,mid), build(rs,mid+1,R); s[p]=s[ls]*s[rs];

}
node kkk;
void qry(int p,int l,int r,int x,int y) {
  if(l==x&&r==y) {kkk=kkk*s[p]; return;} int mid=l+r>>1;
  if(y<=mid) qry(ls,l,mid,x,y); 
  else if(x>mid) qry(rs,mid+1,r,x,y);
  else qry(ls,l,mid,x,mid), qry(rs,mid+1,r,mid+1,y);
}
void mdf(int p,int L,int R,int x) {
  if(L==R) {
    int x=L;
    rep(i,0,k-1) rep(j,0,k) s[p].a[i].f[j]=0;
    rep(i,0,m-1) s[p].a[i].f[i+m]=1;
    rep(i,0,m-1) {
      s[p].a[i+m].f[i+m]=1;
      (s[p].a[i+m].f[xu(i)+m]+=mod-u[x][i])%=mod;
      (s[p].a[i+m].f[xd(i)+m]+=mod-d[x][i])%=mod;
      s[p].a[i+m].f[i]=mod-l[x][i];
      s[p].a[i+m].f[k]=mod-1;
      int qr=ksm(r[x][i],mod-2);
      rep(j,0,k) (s[p].a[i+m].f[j]*=qr)%=mod;
    }
    return;
  }int mid=L+R>>1;
  if(x<=mid) mdf(ls,L,mid,x);
  else mdf(rs,mid+1,R,x);
  s[p]=s[ls]*s[rs];
}

int a[25][25],b[25];
void gauss(int n) {
  //rep(i,0,n-1) {
  //  rep(j,0,n) cout<<a[i][j]<<" "; puts("");
  //}
  rep(i,0,n-1) {
    int r=i; while(!a[r][i]) r++; swap(a[r],a[i]);
    int w=ksm(a[i][i],mod-2);
    rep(j,0,n-1) if(i!=j) {
      int pp=w*a[j][i]%mod;
      rep(k,0,n) a[j][k]=(a[j][k]-a[i][k]*pp)%mod;
    }
  }
  rep(i,0,n-1) b[i]=a[i][n]*ksm(a[i][i],mod-2)%mod;
}

void query() {
  int k=2*m;
  int sx=read(), sy=read(), tx=read(), ty=read();
  rep(i,0,9) rep(j,0,11) kkk.a[i].f[j]=0;
  rep(i,0,9) kkk.a[i].f[i]=1;
  rep(i,0,24) rep(j,0,24) a[i][j]=0;
  if(tx!=n-1) qry(1,0,n-1,tx+1,n-1);
  node tk=kkk;
  if(tx!=0) qry(1,0,n-1,0,tx-1);
  int w=0;
  //rep(i,0,k-1) {
  //  rep(j,0,k) cout<<kkk.a[i].f[j]<<" "; puts("");
  //}
  //cout<<"---"<<endl;
  rep(i,0,m-1) {
    rep(j,0,k-1) a[i][j]=kkk.a[i+m].f[j]-(j==i);
    a[i][k]=mod-kkk.a[i+m].f[k];
    ++w;
  }
  rep(i,0,m-1) if(i!=ty) {
    (a[w][xu(i)]+=u[tx][i])%=mod;
    (a[w][xd(i)]+=d[tx][i])%=mod;
    a[w][i+m]=r[tx][i];
    rep(j,0,k-1) (a[w][j]+=l[tx][i]*kkk.a[i].f[j])%=mod;
    a[w][k]--, a[w][i]--; a[w][k]=(a[w][k]-l[tx][i]*kkk.a[i].f[k])%mod;
    ++w;
  }
  a[w][ty]=1, a[w][k]=0;
  gauss(k);
  if(sx>tx) {
    rep(i,0,9) rep(j,0,11) kkk.a[i].f[j]=0;
    rep(i,0,9) kkk.a[i].f[i]=1;
    qry(1,0,n-1,tx+1,sx);
  } else {
    kkk=tk;
    qry(1,0,n-1,0,sx);
  }
  int ans=kkk.a[sy].f[k];
  rep(i,0,k-1) ans=(ans+kkk.a[sy].f[i]*b[i])%mod;
  printf("%lld\n",(ans%mod+mod)%mod);
}

signed main() {
  n=read(), m=read(); k=2*m;
  rep(i,0,n-1) rep(j,0,m-1) u[i][j]=read()*ksm(100,mod-2)%mod;
  rep(i,0,n-1) rep(j,0,m-1) d[i][j]=read()*ksm(100,mod-2)%mod;
  rep(i,0,n-1) rep(j,0,m-1) l[i][j]=read()*ksm(100,mod-2)%mod;
  rep(i,0,n-1) rep(j,0,m-1) r[i][j]=read()*ksm(100,mod-2)%mod;
  build(1,0,n-1);

  rep(i,0,9) rep(j,0,11) kkk.a[i].f[j]=0;
  rep(i,0,9) kkk.a[i].f[i]=1;
  T=read();
  while(T--) {
    int op=read();
    if(op==1) {
      int x=read(), y=read();
      u[x][y]=read()*ksm(100,mod-2)%mod,d[x][y]=read()*ksm(100,mod-2)%mod;
      l[x][y]=read()*ksm(100,mod-2)%mod,r[x][y]=read()*ksm(100,mod-2)%mod;
      mdf(1,0,n-1,x);
    }
    else query();
  }
  return 0;
}