//A tree without skin will surely die.
//A man without face will be alive.
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define chkmax(x,y) (x=max(x,y))
#define rep(i,j,k) for (int i=j;i<=k;++i)
#define per(i,j,k) for (int i=j;i>=k;--i)
int const N=105;
int const M=1e6+10;
int n,q,u[N],v[N],w[N][N],a[M],b[M],c[M],d[M],ans[M];
int dp1[N][N][N][2][2],dp2[N][N][N][2][2];
inline void work(int l,int r,int x,int y,vector<int>id){
    if (l>r || x>y || !id.size()) return;
    // if (r-l+1>=y-x+1){
        int md=(l+r)>>1;
        vector<int>L,R,M;
        for (auto i:id)
            if (b[i]<md) L.push_back(i);
            else if (a[i]>md) R.push_back(i);
            else M.push_back(i);
        work(l,md-1,x,y,L),work(md+1,r,x,y,R);
        rep(tp,0,1){
            memset(dp1,-0x3f,sizeof(dp1));
            rep(L,x,y) dp1[md-1][L-1][L][0][0]=0;
            rep(R,x,y) rep(L,R-1,y) rep(i,md,r)
                rep(s,0,1) rep(t,0,1){
                    chkmax(dp1[i][L][R][0][t],dp1[i-1][L][R][s][t]);
                    if (R<=L) chkmax(dp1[i][L][R][1][1],dp1[i-1][L][R][s][t]-u[i]-(!t)*v[L]+w[i][L]);
                    if (R<=L && !(L==R && tp)) chkmax(dp1[i][L][R][s][0],dp1[i][L-1][R][s][t]);
                    if (R<=L) chkmax(dp1[i][L][R][1][1],dp1[i][L-1][R][s][t]-(!s)*u[i]-v[L]+w[i][L]);
                }
            memset(dp2,-0x3f,sizeof(dp2));
            rep(L,x-1,y+1) dp2[md][L][L-1][0][0]=0;
            rep(R,x-1,y) per(L,R+1,x) per(i,md-1,l)
                rep(s,0,1) rep(t,0,1){
                    chkmax(dp2[i][L][R][0][t],dp2[i+1][L][R][s][t]);
                    if (L<=R) chkmax(dp2[i][L][R][1][1],dp2[i+1][L][R][s][t]-u[i]-(!t)*v[L]+w[i][L]);
                    if (L<=R && !(L==R && tp)) chkmax(dp2[i][L][R][s][0],dp2[i][L+1][R][s][t]);
                    if (L<=R) chkmax(dp2[i][L][R][1][1],dp2[i][L+1][R][s][t]-(!s)*u[i]-v[L]+w[i][L]);
                }
            for (auto i:M){
                rep(k,c[i],d[i]){
                    int lef=-1e18,rig=-1e18;
                    rep(s,0,1) rep(t,0,1)
                        lef=max(lef,dp2[a[i]][c[i]][k][s][t]),
                        rig=max(rig,dp1[b[i]][d[i]][k][s][t]);
                    if (!tp) lef=max(0ll,lef),rig=max(0ll,rig);
                    ans[i]=max(ans[i],lef+rig+tp*v[k]);
                }
            }
        }
    // }
}
inline void solve(){
    cin>>n>>q;
    rep(i,1,n) cin>>u[i];
    rep(i,1,n) cin>>v[i];
    rep(i,1,n) rep(j,1,n) cin>>w[i][j];
    vector<int>id;
    rep(i,1,q) cin>>a[i]>>b[i]>>c[i]>>d[i],id.push_back(i);
    work(1,n,1,n,id);
    rep(i,1,q) cout<<ans[i]<<'\n';
}
signed main(){
    // freopen("test.in","r",stdin);
    // freopen("test.out","w",stdout);
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while (t--) solve();
    cerr<<"Time: "<<(double)clock()/CLOCKS_PER_SEC<<" s\n";
    return 0;
}