#include <array>
#include <bits/stdc++.h>
using namespace std;

using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;
#define rep3(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define rep2(i, a, b) rep3(i, a, b, 1)
#define rep1(i, n) rep2(i, 0, n)
#define rep0(n) rep1(aaaaa, n)
#define ov4(a, b, c, d, name, ...) name
#define rep(...) ov4(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define per(i, a, b) for (ll i = (a) - 1; i >= (b); i--)
#define fore(e, v) for (auto &&e : v)
#define all(a) begin(a), end(a)
#define sz(a) (int)(size(a))
#define lb(v, x) (lower_bound(all(v), x) - begin(v))
#define eb emplace_back

template <typename T, typename S> bool chmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S> bool chmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
const int INF = 1e9 + 100;
const ll INFL = 3e18 + 100;
#define i128 __int128_t
struct _ {
  _() { cin.tie(0)->sync_with_stdio(0), cout.tie(0); }
} __;

int main(){
  int N,Q;
  cin>>N>>Q;
  vi A(N),B(N);
  fore(i,A)cin>>i;
  fore(i,B)cin>>i;
  vector<array<int, 4>> query(Q);
  rep(i,Q){
    rep(j,4)cin>>query[i][j];
    --query[i][0],--query[i][1];
  }
  using ai3=array<ll, 3>;
  vector add(N+1,vector<array<ll, 3>>());
  rep(i,Q){
    auto [l,d,r,u]=query[i];
    add[l].push_back(ai3{d,i,1});
    add[l].push_back(ai3{u,i,-1});
    add[r].push_back(ai3{d,i,-1});
    add[r].push_back(ai3{u,i,1});
  }
  vl ans(Q),S(N+1);
  A.push_back(0);
  rep(i,N+1){
    for(auto [p,x,c]:add[i]){
      ans[x]+=S[p]*c;
    }
    vi Sl(N+1);
    rep(j,N){
      Sl[j+1]=Sl[j]+max(B[j],A[i]);
    }
    rep(j,N+1){
      S[j]+=Sl[j];
    }

  }
  rep(i,Q)cout<<ans[i]<<'\n';
}