#include <bits/stdc++.h>
#pragma GCC optimize("Ofast", "unroll-loops")
#define ll long long
#define pii pair <int, int>
#define x first
#define y second
#define ld double

using namespace std;

mt19937 gen(time(0));
uniform_int_distribution <int> rng;

const int MOD = (int)1e9 + 7;

template <int MOD>
struct Int {
    int x;

    Int() {
        x = 0;
    }

    Int(int val) {
        x = val;
    }

    Int operator + (const Int &other) const {
        return (x + other.x >= MOD ? x + other.x - MOD : x + other.x);
    }

    Int operator += (const Int &other) {
        return x = (x + other.x >= MOD ? x + other.x - MOD : x + other.x);
    }

    Int operator * (const Int &other) const {
        return 1LL * x * other.x % MOD;
    }

    Int operator *= (const Int &other) {
        return x = 1LL * x * other.x % MOD;
    }

    Int operator - (const Int &other) const {
        return (x - other.x < 0 ? x - other.x + MOD : x - other.x);
    }

    Int operator -= (const Int &other) {
        return x = (x - other.x < 0 ? x - other.x + MOD : x - other.x);
    }

    Int inv() const {
        int ans = 1, y = x, p = MOD - 2;
        while(p) {
            if(p & 1)
                ans = 1LL * ans * y % MOD;
            y = 1LL * y * y % MOD;
            p >>= 1;
        }

        return ans;
    }

    Int operator / (const Int &other) const {
        return *this * other.inv();
    }

    Int operator /= (const Int &other) {
        return *this = *this * other.inv();
    }

    void print() {
        cout << x << " ";
    }
};


bool kek = 1, kek2 = 0;

const int K = 100;
const int N = 80005;

struct Query {
    int a, b, c, d, ind;

    bool operator < (const Query &other) const {
        return (c / K != other.c / K ? c < other.c : ((c / K) % 2 ? d < other.d : d > other.d));
    }
};

const int C = N / K + 5;

int n, m, q, a, b, c, d;

int lg[N];
int v[80005], w[80005], ans[N], val[N];
int va[N], vb[C][K + 5];
int mx[20][C][C];
int rmq[2][17][N];
vector <Query> queries, queries2;
Query vq[N];

int get_mx(int t, int a, int b) {
    int l = lg[b - a + 1];
    return max(rmq[t][l][a], rmq[t][l][b - (1 << l) + 1]);
}

void brut() {
    for(int i = 1; i <= q; i++) {
        Query qr = vq[i];
        val[i] = (get_mx(0, qr.a, qr.b) + get_mx(1, qr.c, qr.d)) % m;
        for(int i = qr.a; i <= qr.b; i++) {
            for(int j = qr.c; j <= qr.d; j++)
                val[qr.ind] = max(val[qr.ind], (v[i] + w[j] < m ? v[i] + w[j] : 0));
        }
        if(kek2)
        cout << i << " : " << val[i] << " si " << ans[i] << "\n";
        assert(val[i] == ans[i]);
    }
}

int op;
int k;

int aib[1600005];

int lsb(int x) {
    return x & -x;
}

void update(int ind, int val) {
    for(int i = ind; i <= k; i += lsb(i))
        aib[i] += val;
}

int query(int ind) {
    int ans = 0;
    for(int i = ind; i; i -= lsb(i))
        ans += aib[i];
    return ans;
}

void add(int poz) {
    update(w[poz], 1);
    op++;
}

void del(int poz) {
    update(w[poz], -1);
    op++;
}

set <int> vals;
map <int, int> cod;
int num[1600005], vinv[N];

void f(vector <Query> &queries) {
    sort(queries.begin(), queries.end());
    k = 0;

    vals.clear();
    cod.clear();
    for(int i = 1; i <= n; i++)
        vals.insert(m - v[i] - 1), vals.insert(w[i]);
    for(auto &i : vals) {
        cod[i] = ++k;
        num[k] = i;
    }
    for(int i = 1; i <= n; i++)
        vinv[i] = cod[m - v[i] - 1], w[i] = cod[w[i]];

    for(int i = 1; i <= k; i++)
        aib[i] = 0;

    int l = 1, r = 0;
    for(auto &qr : queries) {
        while(r > qr.d)
            del(r--);
        while(r < qr.d)
            add(++r);
        while(l < qr.c)
            del(l++);
        while(l > qr.c)
            add(--l);

        for(int i = qr.a; i <= qr.b; i++) {
            int cnt = query(vinv[i]);

            int l = 0;
            for(int j = 17; j >= 0; j--) {
                if(l + (1 << j) <= k && aib[l + (1 << j)] < cnt)
                    cnt -= aib[l + (1 << j)], l += (1 << j);
            }
            l++;

            if(l <= vinv[i]) {
                ans[qr.ind] = max(ans[qr.ind], v[i] + num[l]);
            }
        }
    }

    for(int i = 1; i <= n; i++)
        w[i] = num[w[i]];

    if(kek)
    cout << op << "\n";
}

void solve() {
    ld t1 = clock();
    op = 0;
    if(!kek) {
        cin >> n >> m >> q;
    }
    else {
        n = 80000, m = rng(gen) % 1000000000 + 1, q = 80000;
        if(kek2)
        cout << n << " " << m << " " << q << "\n";
    }

    for(int i = 1; i <= n; i++) {
        if(!kek)
            cin >> v[i];
        else {
            v[i] = rng(gen) % m;
            if(kek2) cout << v[i] << " ";
        }
        rmq[0][0][i] = v[i];
    }
    if(kek && kek2)
        cout << "\n";
    for(int i = 1; i <= n; i++) {
        if(!kek)
            cin >> w[i];
        else {
            w[i] = rng(gen) % m;
            if(kek2) cout << w[i] << " ";
        }
        rmq[1][0][i] = w[i];
    }
    if(kek && kek2)
        cout << "\n";

    for(int i = 2; i < N; i++)
        lg[i] = lg[i / 2] + 1;

    w[0] = m;

    for(int i = 0; i * K <= n; i++) {
        if((i + 1) * K - 1 > n)
            continue;
        int nr = 0;
        for(int j = i * K; j < (i + 1) * K; j++)
            vb[i][++nr] = w[j];
        sort(vb[i] + 1, vb[i] + nr + 1);
    }

    v[0] = m;
    for(int i = 0; i * K <= n; i++) {
        int nr = 0;
        for(int j = i * K; j < (i + 1) * K && j <= n; j++)
            va[++nr] = v[j];
        sort(va + 1, va + nr + 1);
        if(nr != K)
            continue;
        for(int j = 0; j * K <= n; j++) {
            if((j + 1) * K - 1 > n)
                continue;
            mx[0][i][j] = 0;
            int ind = K;
            for(int k = 1; k <= K; k++) {
                while(ind && va[k] + vb[j][ind] >= m)
                    ind--;
                if(ind)
                    mx[0][i][j] = max(mx[0][i][j], va[k] + vb[j][ind]);
            }
        }

        nr = n / K + 10;
        for(int j = 1; (1 << j) <= nr; j++) {
            for(int k = 0; k + (1 << j) - 1 <= nr; k++)
                mx[j][i][k] = max(mx[j - 1][i][k], mx[j - 1][i][k + (1 << (j - 1))]);
        }
    }

    for(int i = 1; (1 << i) <= n; i++) {
        for(int j = 1; j + (1 << i) - 1 <= n; j++) {
            rmq[0][i][j] = max(rmq[0][i - 1][j], rmq[0][i - 1][j + (1 << (i - 1))]);
            rmq[1][i][j] = max(rmq[1][i - 1][j], rmq[1][i - 1][j + (1 << (i - 1))]);
        }
    }

    queries.clear();
    queries2.clear();
    for(int i = 1; i <= q; i++) {
        ans[i] = 0;
        if(!kek)
            cin >> a >> b >> c >> d;
        else {
            a = rng(gen) % n + 1;
            b = rng(gen) % (n - a + 1) + a;
            c = rng(gen) % n + 1;
            d = rng(gen) % (n - c + 1) + c;
            if(kek2)
            cout << a << " " << b << " " << c << " " << d << "\n";
        }
        vq[i] = {a, b, c, d, i};
        int ga = a / K, gb = b / K, gc = c / K, gd = d / K;

        ans[i] = (get_mx(0, a, b) + get_mx(1, c, d)) % m;

        if(gc + 1 <= gd - 1) {
            for(int j = ga + 1; j < gb; j++) {
                int l = lg[gd - gc - 1];
                ans[i] = max({ans[i], mx[l][j][gc + 1], mx[l][j][gd - (1 << l)]}); // max intre v[j][gc + 1] si v[j][gd - 1]
            }
        }

        if(ga == gb) {
            queries.push_back({a, b, c, d, i});
        }
        else {
            queries.push_back({a, min(n, (ga + 1) * K - 1), c, d, i});
            queries.push_back({max(1, gb * K), b, c, d, i});
        }

        if(gc != gd) {
            queries2.push_back({c, min((gc + 1) * K - 1, n), a, b, i});
            queries2.push_back({max(1, gd * K), d, a, b, i});
        }
        else {
            queries2.push_back({c, d, a, b, i});
        }
    }

    if(kek)
    cout << (clock() - t1) / CLOCKS_PER_SEC << "s before\n";

    f(queries);
    for(int i = 1; i <= n; i++)
        swap(v[i], w[i]);
    f(queries2);
    for(int i = 1; i <= n; i++)
        swap(v[i], w[i]);

    if(!kek) {
        for(int i = 1; i <= q; i++)
            cout << ans[i] << "\n";
    }

    //brut();

    if(kek)
    cout << (clock() - t1) / CLOCKS_PER_SEC << "s\n";
}

int main() {
    //ios_base::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    srand(time(0));

    int T = (kek ? 1000 : 1);
    for(; T; T--) {
        solve();
    }

    return 0;
}