#include <algorithm>
#include <atcoder/all>
#include <bitset>
#include <cassert>
#include <cmath>
#include <ctime>
#include <functional>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>
using namespace std;
using namespace atcoder;
typedef long long ll;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n) - 1; i >= 0; i--)
#define repk(i, k, n) for (int i = k; i < (int)(n); i++)
#define all(v) v.begin(), v.end()
#define mod1 1000000007
#define mod2 998244353
#define mod3 100000007
#define vi vector<int>
#define vs vector<string>
#define vc vector<char>
#define vl vector<ll>
#define vb vector<bool>
#define vvi vector<vector<int>>
#define vvc vector<vector<char>>
#define vvl vector<vector<ll>>
#define vvb vector<vector<bool>>
#define vvvi vector<vector<vector<int>>>
#define vvvl vector<vector<vector<ll>>>
#define pii pair<int, int>
#define pil pair<int, ll>
#define pli pair<ll, int>
#define pll pair<ll, ll>
#define vpii vector<pair<int, int>>
#define vpll vector<pair<ll, ll>>
#define vvpii vector<vector<pair<int, int>>>
#define vvpll vector<vector<pair<ll, ll>>>

template <typename T>
void debug(T e) {
    cerr << e << endl;
}

template <typename T>
void debug(vector<T> &v) {
    rep(i, v.size()) { cerr << v[i] << " "; }
    cerr << endl;
}

template <typename T>
void debug(vector<vector<T>> &v) {
    rep(i, v.size()) {
        rep(j, v[i].size()) { cerr << v[i][j] << " "; }
        cerr << endl;
    }
}

template <typename T>
void debug(vector<pair<T, T>> &v) {
    rep(i, v.size()) { cerr << v[i].first << " " << v[i].second << endl; }
}

template <typename T>
void debug(set<T> &st) {
    for (auto itr = st.begin(); itr != st.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(multiset<T> &ms) {
    for (auto itr = ms.begin(); itr != ms.end(); itr++) {
        cerr << *itr << " ";
    }
    cerr << endl;
}

template <typename T>
void debug(map<T, T> &mp) {
    for (auto itr = mp.begin(); itr != mp.end(); itr++) {
        cerr << itr->first << " " << itr->second << endl;
    }
}

void debug_out() { cerr << endl; }

template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
    cerr << H << " ";
    debug_out(T...);
}

using mint = modint1000000007;

void debug_mint1(vector<mint> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        cerr << vec[i].val() << " ";
    }
    cerr << endl;
}

void debug_mint2(vector<vector<mint>> &vec) {
    for (int i = 0; i < vec.size(); i++) {
        for (int j = 0; j < vec[i].size(); j++) {
            cerr << vec[i][j].val() << " ";
        }
        cerr << endl;
    }
}

ll op(ll a, ll b){
    return a + b;
}

ll e(){
    return 0LL;
}

int main() {
    ll N, Q;
    cin >> N >> Q;
    vector<ll> A(N);
    vector<ll> B(N);
    rep(i, N){
        cin >> A[i];
    }
    rep(i, N) cin >> B[i];
    vector<ll> l(Q);
    vector<ll> d(Q);
    vector<ll> r(Q);
    vector<ll> u(Q);
    for (ll i = 0; i < Q; i++){
        cin >> l[i] >> d[i] >> r[i] >> u[i];
        l[i]--;
        d[i]--;
        r[i]--;
        u[i]--;
    }
    ll L = 0;
    rep(i, N){
        L = max(L, A[i]);
        L = max(L, B[i]);
    }
    L++;
    vector<ll> vecs(L + 1, -1);
    map<ll, ll> mp;
    rep(i, N){
        mp[A[i]]++;
        mp[B[i]]++;
    }
    ll now = 0;
    for (auto it = mp.begin(); it != mp.end(); it++){
        vecs[it->first] = now;
        now++;
    }

    segtree<ll, op, e> segh1(L);
    segtree<ll, op, e> segh2(L);
    segtree<ll, op, e> segw1(L);
    segtree<ll, op, e> segw2(L);
    
    ll now_h = -1;
    ll now_w = -1;
    
    ll b = 700;
    vector<ll> ans(Q, 0);
    vector<vector<pair<ll, pll>>> qs(N / b + 1, vector<pair<ll, pll>>(0));
    for (ll i = 0; i < Q; i++){
        if (l[i] > 0){
            if (d[i] > 0) qs[(l[i] - 1) / b].push_back(make_pair(d[i] - 1, make_pair(i * 2 + 1, l[i] - 1)));
            qs[(l[i] - 1) / b].push_back(make_pair(u[i], make_pair(i * 2, l[i] - 1)));
        }
        if (d[i] > 0) qs[r[i] / b].push_back(make_pair(d[i] - 1, make_pair(i * 2, r[i])));
        qs[r[i] / b].push_back(make_pair(u[i], make_pair(i * 2 + 1, r[i])));
    }
    for (ll i = 0; i <= N / b; i++){
        sort(all(qs[i]));
        if (i % 2 == 1) reverse(all(qs[i]));
    }

    ll now_ans = 0;
    for (ll i = 0; i <= N / b; i++){
        for (ll j = 0; j < qs[i].size(); j++){
            ll id = qs[i][j].second.first / 2;
            ll sign = qs[i][j].second.first % 2;

            ll new_h = qs[i][j].second.second;
            ll new_w = qs[i][j].first;
            // debug_out(new_h, new_w, id, sign);

            // 処理
            if (now_h < new_h){
                for (ll k = now_h + 1; k <= new_h; k++){
                    now_ans += segw2.prod(A[k], L) + segw1.prod(0, A[k]) * A[k];
                    segh1.set(A[k], segh1.get(A[k]) + 1);
                    segh2.set(A[k], segh2.get(A[k]) + A[k]);
                }
            }
            else{
                for (ll k = now_h; k > new_h; k--){
                    now_ans -= (segw2.prod(A[k], L) + segw1.prod(0, A[k]) * A[k]);
                    segh1.set(A[k], segh1.get(A[k]) - 1);
                    segh2.set(A[k], segh2.get(A[k]) - A[k]);
                }
            }
            if (now_w < new_w){
                for (ll k = now_w + 1; k <= new_w; k++){
                    now_ans += segh2.prod(B[k], L) + segh1.prod(0, B[k]) * B[k];
                    segw1.set(B[k], segw1.get(B[k]) + 1);
                    segw2.set(B[k], segw2.get(B[k]) + B[k]);
                }
            }
            else{
                for (ll k = now_w; k > new_w; k--){
                    now_ans -= (segh2.prod(B[k], L) + segh1.prod(0, B[k]) * B[k]);
                    segw1.set(B[k], segw1.get(B[k]) - 1);
                    segw2.set(B[k], segw2.get(B[k]) - B[k]);
                }
            }
            now_h = new_h;
            now_w = new_w;
            if (sign == 1){
                ans[id] += now_ans;
            }
            else{
                ans[id] -= now_ans;
            }
        }
    }
    for (ll i = 0; i < Q; i++){
        cout << ans[i] << endl;
    }
}