#include <bits/stdc++.h>
#include <cassert>

using namespace std;
using ll = long long;

#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define pb push_back
#define ff first
#define sc second
#define int ll

mt19937 rnd(time(NULL));
template<typename T>
void shuf(vector<T>& a) {
    for (int i = 1; i < sz(a); i++) swap(a[i], a[rnd() % (i + 1)]);
}

void solve() {
    int n, q; cin >> n >> q;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    for (int i =0; i < n; i++) cin >> b[i];
    vector<int> pref(n + 1);
    for (int i = 1; i <= n; i++) pref[i] = pref[i - 1] + a[i - 1];
    vector<int> nxt(n + 1, -1);
    stack<int> st;
    for (int i = n - 1; i >= 0; i--) {
        while (!st.empty() && b[st.top()] >= b[i]) st.pop();
        nxt[i] = (st.empty() ? -1 : st.top());
        st.push(i);
    }
    while (q--) {
        int s, t, u; cin >> s >> t >> u;
        s--; t--;
        int cango = s, benz = 0, ans = 0;
        for (int i = s; i <= t; i++) {
            int vr1 = u - benz;
            int vr2 = max(0ll, (nxt[i] == -1 || nxt[i] > t ? pref[t] : pref[nxt[i]]) - pref[i] - benz);
            if (vr1 < vr2) {
                ans += b[i] * (u - benz);
                benz = u;
                if (i < t) benz -= a[i];
            } else {
                ans += b[i] * vr2;
                benz += vr2;
                if (i < t) benz -= a[i];
            }
            if (benz < 0) ans = -1e18;
        }
        cout << (ans < 0 ? -1 : ans) << '\n';
    }
}

signed main() {
    int tt = 1;
    #ifdef LOCAL
        freopen("in.txt", "r", stdin);
        freopen("out.txt", "w", stdout);
        //cin >> tt;
    #else
        ios::sync_with_stdio(false);
        cin.tie(0); cout.tie(0);
    #endif

    while (tt--) {
        solve();
    }

    return 0;
}